279.12/235.70 YES 279.12/235.70 279.12/235.70 Ultimate: Cannot open display: 279.12/235.70 This is Ultimate 0.1.24-8dc7c08-m 279.12/235.70 [2019-03-28 12:42:32,070 INFO L170 SettingsManager]: Resetting all preferences to default values... 279.12/235.70 [2019-03-28 12:42:32,073 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 279.12/235.70 [2019-03-28 12:42:32,084 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 279.12/235.70 [2019-03-28 12:42:32,084 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 279.12/235.70 [2019-03-28 12:42:32,085 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 279.12/235.70 [2019-03-28 12:42:32,087 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 279.12/235.70 [2019-03-28 12:42:32,088 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 279.12/235.70 [2019-03-28 12:42:32,090 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 279.12/235.70 [2019-03-28 12:42:32,090 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 279.12/235.70 [2019-03-28 12:42:32,091 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 279.12/235.70 [2019-03-28 12:42:32,092 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 279.12/235.70 [2019-03-28 12:42:32,092 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 279.12/235.70 [2019-03-28 12:42:32,093 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 279.12/235.70 [2019-03-28 12:42:32,094 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 279.12/235.70 [2019-03-28 12:42:32,095 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 279.12/235.70 [2019-03-28 12:42:32,096 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 279.12/235.70 [2019-03-28 12:42:32,098 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 279.12/235.70 [2019-03-28 12:42:32,100 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 279.12/235.70 [2019-03-28 12:42:32,101 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 279.12/235.70 [2019-03-28 12:42:32,102 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 279.12/235.70 [2019-03-28 12:42:32,104 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 279.12/235.70 [2019-03-28 12:42:32,106 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 279.12/235.70 [2019-03-28 12:42:32,106 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 279.12/235.70 [2019-03-28 12:42:32,106 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 279.12/235.70 [2019-03-28 12:42:32,107 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 279.12/235.70 [2019-03-28 12:42:32,107 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 279.12/235.70 [2019-03-28 12:42:32,108 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 279.12/235.70 [2019-03-28 12:42:32,109 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 279.12/235.70 [2019-03-28 12:42:32,109 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 279.12/235.70 [2019-03-28 12:42:32,110 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 279.12/235.70 [2019-03-28 12:42:32,111 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 279.12/235.70 [2019-03-28 12:42:32,112 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 279.12/235.70 [2019-03-28 12:42:32,112 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 279.12/235.70 [2019-03-28 12:42:32,112 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 279.12/235.70 [2019-03-28 12:42:32,113 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 279.12/235.70 [2019-03-28 12:42:32,113 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 279.12/235.70 [2019-03-28 12:42:32,114 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 279.12/235.70 [2019-03-28 12:42:32,115 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 279.12/235.70 [2019-03-28 12:42:32,115 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 279.12/235.70 [2019-03-28 12:42:32,129 INFO L110 SettingsManager]: Loading preferences was successful 279.12/235.70 [2019-03-28 12:42:32,130 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 279.12/235.70 [2019-03-28 12:42:32,131 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 279.12/235.70 [2019-03-28 12:42:32,131 INFO L133 SettingsManager]: * Rewrite not-equals=true 279.12/235.70 [2019-03-28 12:42:32,131 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 279.12/235.70 [2019-03-28 12:42:32,131 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 279.12/235.70 [2019-03-28 12:42:32,132 INFO L133 SettingsManager]: * Use SBE=true 279.12/235.70 [2019-03-28 12:42:32,132 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 279.12/235.70 [2019-03-28 12:42:32,132 INFO L133 SettingsManager]: * Use old map elimination=false 279.12/235.70 [2019-03-28 12:42:32,132 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 279.12/235.70 [2019-03-28 12:42:32,132 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 279.12/235.70 [2019-03-28 12:42:32,132 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 279.12/235.70 [2019-03-28 12:42:32,133 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 279.12/235.70 [2019-03-28 12:42:32,133 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 279.12/235.70 [2019-03-28 12:42:32,133 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 279.12/235.70 [2019-03-28 12:42:32,133 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 279.12/235.70 [2019-03-28 12:42:32,133 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 279.12/235.70 [2019-03-28 12:42:32,133 INFO L133 SettingsManager]: * Check division by zero=IGNORE 279.12/235.70 [2019-03-28 12:42:32,134 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 279.12/235.70 [2019-03-28 12:42:32,134 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 279.12/235.70 [2019-03-28 12:42:32,134 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 279.12/235.70 [2019-03-28 12:42:32,134 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 279.12/235.70 [2019-03-28 12:42:32,134 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 279.12/235.70 [2019-03-28 12:42:32,135 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 279.12/235.70 [2019-03-28 12:42:32,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 279.12/235.70 [2019-03-28 12:42:32,135 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 279.12/235.70 [2019-03-28 12:42:32,135 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 279.12/235.70 [2019-03-28 12:42:32,135 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 279.12/235.70 [2019-03-28 12:42:32,135 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 279.12/235.70 [2019-03-28 12:42:32,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 279.12/235.70 [2019-03-28 12:42:32,174 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 279.12/235.70 [2019-03-28 12:42:32,178 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 279.12/235.70 [2019-03-28 12:42:32,179 INFO L271 PluginConnector]: Initializing CDTParser... 279.12/235.70 [2019-03-28 12:42:32,180 INFO L276 PluginConnector]: CDTParser initialized 279.12/235.70 [2019-03-28 12:42:32,181 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 279.12/235.70 [2019-03-28 12:42:32,247 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/ca72d77caba1463db061a799d24bbfad/FLAG7ff38931a 279.12/235.70 [2019-03-28 12:42:32,583 INFO L307 CDTParser]: Found 1 translation units. 279.12/235.70 [2019-03-28 12:42:32,583 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 279.12/235.70 [2019-03-28 12:42:32,584 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 279.12/235.70 [2019-03-28 12:42:32,590 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/ca72d77caba1463db061a799d24bbfad/FLAG7ff38931a 279.12/235.70 [2019-03-28 12:42:32,986 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/ca72d77caba1463db061a799d24bbfad 279.12/235.70 [2019-03-28 12:42:32,998 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 279.12/235.70 [2019-03-28 12:42:33,000 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 279.12/235.70 [2019-03-28 12:42:33,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 279.12/235.70 [2019-03-28 12:42:33,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 279.12/235.70 [2019-03-28 12:42:33,006 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 279.12/235.70 [2019-03-28 12:42:33,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:42:32" (1/1) ... 279.12/235.70 [2019-03-28 12:42:33,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c6ab90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:33, skipping insertion in model container 279.12/235.70 [2019-03-28 12:42:33,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:42:32" (1/1) ... 279.12/235.70 [2019-03-28 12:42:33,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 279.12/235.70 [2019-03-28 12:42:33,036 INFO L176 MainTranslator]: Built tables and reachable declarations 279.12/235.70 [2019-03-28 12:42:33,203 INFO L206 PostProcessor]: Analyzing one entry point: main 279.12/235.70 [2019-03-28 12:42:33,216 INFO L191 MainTranslator]: Completed pre-run 279.12/235.70 [2019-03-28 12:42:33,235 INFO L206 PostProcessor]: Analyzing one entry point: main 279.12/235.70 [2019-03-28 12:42:33,311 INFO L195 MainTranslator]: Completed translation 279.12/235.70 [2019-03-28 12:42:33,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:33 WrapperNode 279.12/235.70 [2019-03-28 12:42:33,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 279.12/235.70 [2019-03-28 12:42:33,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 279.12/235.70 [2019-03-28 12:42:33,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 279.12/235.70 [2019-03-28 12:42:33,313 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 279.12/235.70 [2019-03-28 12:42:33,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:33" (1/1) ... 279.12/235.70 [2019-03-28 12:42:33,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:33" (1/1) ... 279.12/235.70 [2019-03-28 12:42:33,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 279.12/235.70 [2019-03-28 12:42:33,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 279.12/235.70 [2019-03-28 12:42:33,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 279.12/235.70 [2019-03-28 12:42:33,355 INFO L276 PluginConnector]: Boogie Preprocessor initialized 279.12/235.70 [2019-03-28 12:42:33,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:33" (1/1) ... 279.12/235.70 [2019-03-28 12:42:33,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:33" (1/1) ... 279.12/235.70 [2019-03-28 12:42:33,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:33" (1/1) ... 279.12/235.70 [2019-03-28 12:42:33,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:33" (1/1) ... 279.12/235.70 [2019-03-28 12:42:33,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:33" (1/1) ... 279.12/235.70 [2019-03-28 12:42:33,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:33" (1/1) ... 279.12/235.70 [2019-03-28 12:42:33,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:33" (1/1) ... 279.12/235.70 [2019-03-28 12:42:33,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 279.12/235.70 [2019-03-28 12:42:33,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 279.12/235.70 [2019-03-28 12:42:33,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... 279.12/235.70 [2019-03-28 12:42:33,381 INFO L276 PluginConnector]: RCFGBuilder initialized 279.12/235.70 [2019-03-28 12:42:33,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:33" (1/1) ... 279.12/235.70 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 279.12/235.70 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 279.12/235.70 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 279.12/235.70 [2019-03-28 12:42:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 279.12/235.70 [2019-03-28 12:42:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 279.12/235.70 [2019-03-28 12:42:33,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 279.12/235.70 [2019-03-28 12:42:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 279.12/235.70 [2019-03-28 12:42:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 279.12/235.70 [2019-03-28 12:42:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 279.12/235.70 [2019-03-28 12:42:33,800 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 279.12/235.70 [2019-03-28 12:42:33,801 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 279.12/235.70 [2019-03-28 12:42:33,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:42:33 BoogieIcfgContainer 279.12/235.70 [2019-03-28 12:42:33,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 279.12/235.70 [2019-03-28 12:42:33,803 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 279.12/235.70 [2019-03-28 12:42:33,803 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 279.12/235.70 [2019-03-28 12:42:33,805 INFO L276 PluginConnector]: BlockEncodingV2 initialized 279.12/235.70 [2019-03-28 12:42:33,806 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:42:33" (1/1) ... 279.12/235.70 [2019-03-28 12:42:33,825 INFO L313 BlockEncoder]: Initial Icfg 60 locations, 62 edges 279.12/235.70 [2019-03-28 12:42:33,826 INFO L258 BlockEncoder]: Using Remove infeasible edges 279.12/235.70 [2019-03-28 12:42:33,827 INFO L263 BlockEncoder]: Using Maximize final states 279.12/235.70 [2019-03-28 12:42:33,828 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 279.12/235.70 [2019-03-28 12:42:33,828 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 279.12/235.70 [2019-03-28 12:42:33,830 INFO L296 BlockEncoder]: Using Remove sink states 279.12/235.70 [2019-03-28 12:42:33,831 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 279.12/235.70 [2019-03-28 12:42:33,831 INFO L179 BlockEncoder]: Using Rewrite not-equals 279.12/235.70 [2019-03-28 12:42:33,857 INFO L185 BlockEncoder]: Using Use SBE 279.12/235.70 [2019-03-28 12:42:33,866 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 279.12/235.70 [2019-03-28 12:42:33,963 INFO L200 BlockEncoder]: SBE split 33 edges 279.12/235.70 [2019-03-28 12:42:33,970 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 279.12/235.70 [2019-03-28 12:42:33,972 INFO L71 MaximizeFinalStates]: 0 new accepting states 279.12/235.70 [2019-03-28 12:42:34,036 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding 279.12/235.70 [2019-03-28 12:42:34,039 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 279.12/235.70 [2019-03-28 12:42:34,041 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 279.12/235.70 [2019-03-28 12:42:34,042 INFO L71 MaximizeFinalStates]: 0 new accepting states 279.12/235.70 [2019-03-28 12:42:34,042 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 279.12/235.70 [2019-03-28 12:42:34,043 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 279.12/235.70 [2019-03-28 12:42:34,044 INFO L313 BlockEncoder]: Encoded RCFG 51 locations, 211 edges 279.12/235.70 [2019-03-28 12:42:34,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:42:34 BasicIcfg 279.12/235.70 [2019-03-28 12:42:34,045 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 279.12/235.70 [2019-03-28 12:42:34,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 279.12/235.70 [2019-03-28 12:42:34,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... 279.12/235.70 [2019-03-28 12:42:34,049 INFO L276 PluginConnector]: TraceAbstraction initialized 279.12/235.70 [2019-03-28 12:42:34,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:42:32" (1/4) ... 279.12/235.70 [2019-03-28 12:42:34,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ab45a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:42:34, skipping insertion in model container 279.12/235.70 [2019-03-28 12:42:34,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:33" (2/4) ... 279.12/235.70 [2019-03-28 12:42:34,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ab45a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:42:34, skipping insertion in model container 279.12/235.70 [2019-03-28 12:42:34,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:42:33" (3/4) ... 279.12/235.70 [2019-03-28 12:42:34,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ab45a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:42:34, skipping insertion in model container 279.12/235.70 [2019-03-28 12:42:34,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:42:34" (4/4) ... 279.12/235.70 [2019-03-28 12:42:34,054 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 279.12/235.70 [2019-03-28 12:42:34,064 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 279.12/235.70 [2019-03-28 12:42:34,072 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. 279.12/235.70 [2019-03-28 12:42:34,089 INFO L257 AbstractCegarLoop]: Starting to check reachability of 30 error locations. 279.12/235.70 [2019-03-28 12:42:34,119 INFO L133 ementStrategyFactory]: Using default assertion order modulation 279.12/235.70 [2019-03-28 12:42:34,120 INFO L382 AbstractCegarLoop]: Interprodecural is true 279.12/235.70 [2019-03-28 12:42:34,120 INFO L383 AbstractCegarLoop]: Hoare is true 279.12/235.70 [2019-03-28 12:42:34,121 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 279.12/235.70 [2019-03-28 12:42:34,121 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 279.12/235.70 [2019-03-28 12:42:34,121 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 279.12/235.70 [2019-03-28 12:42:34,121 INFO L387 AbstractCegarLoop]: Difference is false 279.12/235.70 [2019-03-28 12:42:34,121 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 279.12/235.70 [2019-03-28 12:42:34,121 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 279.12/235.70 [2019-03-28 12:42:34,138 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. 279.12/235.70 [2019-03-28 12:42:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 279.12/235.70 [2019-03-28 12:42:34,145 INFO L394 BasicCegarLoop]: Found error trace 279.12/235.70 [2019-03-28 12:42:34,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 279.12/235.70 [2019-03-28 12:42:34,146 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 279.12/235.70 [2019-03-28 12:42:34,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.70 [2019-03-28 12:42:34,152 INFO L82 PathProgramCache]: Analyzing trace with hash 138932, now seen corresponding path program 1 times 279.12/235.70 [2019-03-28 12:42:34,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.70 [2019-03-28 12:42:34,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.70 [2019-03-28 12:42:34,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:34,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:34,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.70 [2019-03-28 12:42:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.70 [2019-03-28 12:42:34,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.12/235.70 [2019-03-28 12:42:34,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.12/235.70 [2019-03-28 12:42:34,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.12/235.70 [2019-03-28 12:42:34,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.12/235.70 [2019-03-28 12:42:34,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.70 [2019-03-28 12:42:34,400 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. 279.12/235.70 [2019-03-28 12:42:35,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.12/235.70 [2019-03-28 12:42:35,264 INFO L93 Difference]: Finished difference Result 51 states and 211 transitions. 279.12/235.70 [2019-03-28 12:42:35,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.12/235.70 [2019-03-28 12:42:35,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 279.12/235.70 [2019-03-28 12:42:35,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.12/235.70 [2019-03-28 12:42:35,280 INFO L225 Difference]: With dead ends: 51 279.12/235.70 [2019-03-28 12:42:35,280 INFO L226 Difference]: Without dead ends: 47 279.12/235.70 [2019-03-28 12:42:35,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.70 [2019-03-28 12:42:35,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. 279.12/235.70 [2019-03-28 12:42:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. 279.12/235.70 [2019-03-28 12:42:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. 279.12/235.70 [2019-03-28 12:42:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 203 transitions. 279.12/235.70 [2019-03-28 12:42:35,330 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 203 transitions. Word has length 3 279.12/235.70 [2019-03-28 12:42:35,331 INFO L84 Accepts]: Finished accepts. word is rejected. 279.12/235.70 [2019-03-28 12:42:35,331 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 203 transitions. 279.12/235.70 [2019-03-28 12:42:35,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.12/235.70 [2019-03-28 12:42:35,331 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 203 transitions. 279.12/235.70 [2019-03-28 12:42:35,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 279.12/235.70 [2019-03-28 12:42:35,332 INFO L394 BasicCegarLoop]: Found error trace 279.12/235.70 [2019-03-28 12:42:35,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 279.12/235.70 [2019-03-28 12:42:35,332 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 279.12/235.70 [2019-03-28 12:42:35,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.70 [2019-03-28 12:42:35,333 INFO L82 PathProgramCache]: Analyzing trace with hash 138934, now seen corresponding path program 1 times 279.12/235.70 [2019-03-28 12:42:35,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.70 [2019-03-28 12:42:35,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.70 [2019-03-28 12:42:35,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:35,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:35,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.70 [2019-03-28 12:42:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.70 [2019-03-28 12:42:35,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.12/235.70 [2019-03-28 12:42:35,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.12/235.70 [2019-03-28 12:42:35,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.12/235.70 [2019-03-28 12:42:35,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.12/235.70 [2019-03-28 12:42:35,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.70 [2019-03-28 12:42:35,401 INFO L87 Difference]: Start difference. First operand 47 states and 203 transitions. Second operand 3 states. 279.12/235.70 [2019-03-28 12:42:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.12/235.70 [2019-03-28 12:42:36,179 INFO L93 Difference]: Finished difference Result 47 states and 203 transitions. 279.12/235.70 [2019-03-28 12:42:36,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.12/235.70 [2019-03-28 12:42:36,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 279.12/235.70 [2019-03-28 12:42:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.12/235.70 [2019-03-28 12:42:36,181 INFO L225 Difference]: With dead ends: 47 279.12/235.70 [2019-03-28 12:42:36,182 INFO L226 Difference]: Without dead ends: 43 279.12/235.70 [2019-03-28 12:42:36,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.70 [2019-03-28 12:42:36,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. 279.12/235.70 [2019-03-28 12:42:36,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. 279.12/235.70 [2019-03-28 12:42:36,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. 279.12/235.70 [2019-03-28 12:42:36,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 195 transitions. 279.12/235.70 [2019-03-28 12:42:36,191 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 195 transitions. Word has length 3 279.12/235.70 [2019-03-28 12:42:36,191 INFO L84 Accepts]: Finished accepts. word is rejected. 279.12/235.70 [2019-03-28 12:42:36,191 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 195 transitions. 279.12/235.70 [2019-03-28 12:42:36,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.12/235.70 [2019-03-28 12:42:36,191 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 195 transitions. 279.12/235.70 [2019-03-28 12:42:36,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 279.12/235.70 [2019-03-28 12:42:36,192 INFO L394 BasicCegarLoop]: Found error trace 279.12/235.70 [2019-03-28 12:42:36,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 279.12/235.70 [2019-03-28 12:42:36,192 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 279.12/235.70 [2019-03-28 12:42:36,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.70 [2019-03-28 12:42:36,193 INFO L82 PathProgramCache]: Analyzing trace with hash 4301182, now seen corresponding path program 1 times 279.12/235.70 [2019-03-28 12:42:36,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.70 [2019-03-28 12:42:36,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.70 [2019-03-28 12:42:36,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:36,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:36,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.70 [2019-03-28 12:42:36,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.70 [2019-03-28 12:42:36,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.12/235.70 [2019-03-28 12:42:36,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 279.12/235.70 [2019-03-28 12:42:36,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 279.12/235.70 [2019-03-28 12:42:36,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 279.12/235.70 [2019-03-28 12:42:36,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 279.12/235.70 [2019-03-28 12:42:36,267 INFO L87 Difference]: Start difference. First operand 43 states and 195 transitions. Second operand 4 states. 279.12/235.70 [2019-03-28 12:42:37,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.12/235.70 [2019-03-28 12:42:37,061 INFO L93 Difference]: Finished difference Result 43 states and 195 transitions. 279.12/235.70 [2019-03-28 12:42:37,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.12/235.70 [2019-03-28 12:42:37,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 279.12/235.70 [2019-03-28 12:42:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.12/235.70 [2019-03-28 12:42:37,062 INFO L225 Difference]: With dead ends: 43 279.12/235.70 [2019-03-28 12:42:37,063 INFO L226 Difference]: Without dead ends: 42 279.12/235.70 [2019-03-28 12:42:37,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 279.12/235.70 [2019-03-28 12:42:37,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. 279.12/235.70 [2019-03-28 12:42:37,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. 279.12/235.70 [2019-03-28 12:42:37,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 279.12/235.70 [2019-03-28 12:42:37,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 193 transitions. 279.12/235.70 [2019-03-28 12:42:37,070 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 193 transitions. Word has length 4 279.12/235.70 [2019-03-28 12:42:37,070 INFO L84 Accepts]: Finished accepts. word is rejected. 279.12/235.70 [2019-03-28 12:42:37,071 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 193 transitions. 279.12/235.70 [2019-03-28 12:42:37,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 279.12/235.70 [2019-03-28 12:42:37,071 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 193 transitions. 279.12/235.70 [2019-03-28 12:42:37,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 279.12/235.70 [2019-03-28 12:42:37,071 INFO L394 BasicCegarLoop]: Found error trace 279.12/235.70 [2019-03-28 12:42:37,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 279.12/235.70 [2019-03-28 12:42:37,072 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 279.12/235.70 [2019-03-28 12:42:37,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.70 [2019-03-28 12:42:37,072 INFO L82 PathProgramCache]: Analyzing trace with hash 4301184, now seen corresponding path program 1 times 279.12/235.70 [2019-03-28 12:42:37,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.70 [2019-03-28 12:42:37,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.70 [2019-03-28 12:42:37,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:37,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:37,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.70 [2019-03-28 12:42:37,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.70 [2019-03-28 12:42:37,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.12/235.70 [2019-03-28 12:42:37,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.12/235.70 [2019-03-28 12:42:37,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.12/235.70 [2019-03-28 12:42:37,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.12/235.70 [2019-03-28 12:42:37,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.70 [2019-03-28 12:42:37,101 INFO L87 Difference]: Start difference. First operand 42 states and 193 transitions. Second operand 3 states. 279.12/235.70 [2019-03-28 12:42:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.12/235.70 [2019-03-28 12:42:37,662 INFO L93 Difference]: Finished difference Result 43 states and 193 transitions. 279.12/235.70 [2019-03-28 12:42:37,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.12/235.70 [2019-03-28 12:42:37,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 279.12/235.70 [2019-03-28 12:42:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.12/235.70 [2019-03-28 12:42:37,664 INFO L225 Difference]: With dead ends: 43 279.12/235.70 [2019-03-28 12:42:37,664 INFO L226 Difference]: Without dead ends: 42 279.12/235.70 [2019-03-28 12:42:37,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.70 [2019-03-28 12:42:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. 279.12/235.70 [2019-03-28 12:42:37,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. 279.12/235.70 [2019-03-28 12:42:37,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 279.12/235.70 [2019-03-28 12:42:37,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 192 transitions. 279.12/235.70 [2019-03-28 12:42:37,671 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 192 transitions. Word has length 4 279.12/235.70 [2019-03-28 12:42:37,671 INFO L84 Accepts]: Finished accepts. word is rejected. 279.12/235.70 [2019-03-28 12:42:37,671 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 192 transitions. 279.12/235.70 [2019-03-28 12:42:37,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.12/235.70 [2019-03-28 12:42:37,672 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 192 transitions. 279.12/235.70 [2019-03-28 12:42:37,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 279.12/235.70 [2019-03-28 12:42:37,672 INFO L394 BasicCegarLoop]: Found error trace 279.12/235.70 [2019-03-28 12:42:37,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 279.12/235.70 [2019-03-28 12:42:37,673 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 279.12/235.70 [2019-03-28 12:42:37,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.70 [2019-03-28 12:42:37,673 INFO L82 PathProgramCache]: Analyzing trace with hash 4301185, now seen corresponding path program 1 times 279.12/235.70 [2019-03-28 12:42:37,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.70 [2019-03-28 12:42:37,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.70 [2019-03-28 12:42:37,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:37,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:37,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.70 [2019-03-28 12:42:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.70 [2019-03-28 12:42:37,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.12/235.70 [2019-03-28 12:42:37,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.12/235.70 [2019-03-28 12:42:37,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.12/235.70 [2019-03-28 12:42:37,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.12/235.70 [2019-03-28 12:42:37,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.70 [2019-03-28 12:42:37,751 INFO L87 Difference]: Start difference. First operand 42 states and 192 transitions. Second operand 3 states. 279.12/235.70 [2019-03-28 12:42:38,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.12/235.70 [2019-03-28 12:42:38,399 INFO L93 Difference]: Finished difference Result 42 states and 192 transitions. 279.12/235.70 [2019-03-28 12:42:38,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.12/235.70 [2019-03-28 12:42:38,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 279.12/235.70 [2019-03-28 12:42:38,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.12/235.70 [2019-03-28 12:42:38,401 INFO L225 Difference]: With dead ends: 42 279.12/235.70 [2019-03-28 12:42:38,401 INFO L226 Difference]: Without dead ends: 41 279.12/235.70 [2019-03-28 12:42:38,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.70 [2019-03-28 12:42:38,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. 279.12/235.70 [2019-03-28 12:42:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. 279.12/235.70 [2019-03-28 12:42:38,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 279.12/235.70 [2019-03-28 12:42:38,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 191 transitions. 279.12/235.70 [2019-03-28 12:42:38,407 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 191 transitions. Word has length 4 279.12/235.70 [2019-03-28 12:42:38,407 INFO L84 Accepts]: Finished accepts. word is rejected. 279.12/235.70 [2019-03-28 12:42:38,407 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 191 transitions. 279.12/235.70 [2019-03-28 12:42:38,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.12/235.70 [2019-03-28 12:42:38,407 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 191 transitions. 279.12/235.70 [2019-03-28 12:42:38,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 279.12/235.70 [2019-03-28 12:42:38,408 INFO L394 BasicCegarLoop]: Found error trace 279.12/235.70 [2019-03-28 12:42:38,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 279.12/235.70 [2019-03-28 12:42:38,408 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 279.12/235.70 [2019-03-28 12:42:38,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.70 [2019-03-28 12:42:38,408 INFO L82 PathProgramCache]: Analyzing trace with hash 133338810, now seen corresponding path program 1 times 279.12/235.70 [2019-03-28 12:42:38,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.70 [2019-03-28 12:42:38,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.70 [2019-03-28 12:42:38,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:38,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:38,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.70 [2019-03-28 12:42:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.70 [2019-03-28 12:42:38,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.12/235.70 [2019-03-28 12:42:38,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.12/235.70 [2019-03-28 12:42:38,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.12/235.70 [2019-03-28 12:42:38,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.12/235.70 [2019-03-28 12:42:38,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.70 [2019-03-28 12:42:38,454 INFO L87 Difference]: Start difference. First operand 41 states and 191 transitions. Second operand 3 states. 279.12/235.70 [2019-03-28 12:42:39,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.12/235.70 [2019-03-28 12:42:39,100 INFO L93 Difference]: Finished difference Result 41 states and 191 transitions. 279.12/235.70 [2019-03-28 12:42:39,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.12/235.70 [2019-03-28 12:42:39,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 279.12/235.70 [2019-03-28 12:42:39,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.12/235.70 [2019-03-28 12:42:39,101 INFO L225 Difference]: With dead ends: 41 279.12/235.70 [2019-03-28 12:42:39,101 INFO L226 Difference]: Without dead ends: 37 279.12/235.70 [2019-03-28 12:42:39,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.70 [2019-03-28 12:42:39,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. 279.12/235.70 [2019-03-28 12:42:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. 279.12/235.70 [2019-03-28 12:42:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. 279.12/235.70 [2019-03-28 12:42:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 183 transitions. 279.12/235.70 [2019-03-28 12:42:39,106 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 183 transitions. Word has length 5 279.12/235.70 [2019-03-28 12:42:39,107 INFO L84 Accepts]: Finished accepts. word is rejected. 279.12/235.70 [2019-03-28 12:42:39,107 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 183 transitions. 279.12/235.70 [2019-03-28 12:42:39,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.12/235.70 [2019-03-28 12:42:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 183 transitions. 279.12/235.70 [2019-03-28 12:42:39,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 279.12/235.70 [2019-03-28 12:42:39,107 INFO L394 BasicCegarLoop]: Found error trace 279.12/235.70 [2019-03-28 12:42:39,108 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 279.12/235.70 [2019-03-28 12:42:39,108 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 279.12/235.70 [2019-03-28 12:42:39,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.70 [2019-03-28 12:42:39,108 INFO L82 PathProgramCache]: Analyzing trace with hash 133338812, now seen corresponding path program 1 times 279.12/235.70 [2019-03-28 12:42:39,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.70 [2019-03-28 12:42:39,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.70 [2019-03-28 12:42:39,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:39,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:39,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.70 [2019-03-28 12:42:39,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.70 [2019-03-28 12:42:39,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.12/235.70 [2019-03-28 12:42:39,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.12/235.70 [2019-03-28 12:42:39,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.12/235.70 [2019-03-28 12:42:39,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.12/235.70 [2019-03-28 12:42:39,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.70 [2019-03-28 12:42:39,160 INFO L87 Difference]: Start difference. First operand 37 states and 183 transitions. Second operand 3 states. 279.12/235.70 [2019-03-28 12:42:39,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.12/235.70 [2019-03-28 12:42:39,764 INFO L93 Difference]: Finished difference Result 37 states and 183 transitions. 279.12/235.70 [2019-03-28 12:42:39,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.12/235.70 [2019-03-28 12:42:39,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 279.12/235.70 [2019-03-28 12:42:39,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.12/235.70 [2019-03-28 12:42:39,765 INFO L225 Difference]: With dead ends: 37 279.12/235.70 [2019-03-28 12:42:39,765 INFO L226 Difference]: Without dead ends: 33 279.12/235.70 [2019-03-28 12:42:39,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.70 [2019-03-28 12:42:39,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. 279.12/235.70 [2019-03-28 12:42:39,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. 279.12/235.70 [2019-03-28 12:42:39,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. 279.12/235.70 [2019-03-28 12:42:39,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 175 transitions. 279.12/235.70 [2019-03-28 12:42:39,770 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 175 transitions. Word has length 5 279.12/235.70 [2019-03-28 12:42:39,770 INFO L84 Accepts]: Finished accepts. word is rejected. 279.12/235.70 [2019-03-28 12:42:39,770 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 175 transitions. 279.12/235.70 [2019-03-28 12:42:39,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.12/235.70 [2019-03-28 12:42:39,770 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 175 transitions. 279.12/235.70 [2019-03-28 12:42:39,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 279.12/235.70 [2019-03-28 12:42:39,771 INFO L394 BasicCegarLoop]: Found error trace 279.12/235.70 [2019-03-28 12:42:39,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 279.12/235.70 [2019-03-28 12:42:39,771 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 279.12/235.70 [2019-03-28 12:42:39,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.70 [2019-03-28 12:42:39,771 INFO L82 PathProgramCache]: Analyzing trace with hash -161469547, now seen corresponding path program 1 times 279.12/235.70 [2019-03-28 12:42:39,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.70 [2019-03-28 12:42:39,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.70 [2019-03-28 12:42:39,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:39,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:39,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.70 [2019-03-28 12:42:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.70 [2019-03-28 12:42:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.70 [2019-03-28 12:42:39,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.12/235.70 [2019-03-28 12:42:39,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 279.12/235.70 [2019-03-28 12:42:39,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 279.12/235.70 [2019-03-28 12:42:39,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 279.12/235.70 [2019-03-28 12:42:39,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 279.12/235.70 [2019-03-28 12:42:39,819 INFO L87 Difference]: Start difference. First operand 33 states and 175 transitions. Second operand 4 states. 279.12/235.71 [2019-03-28 12:42:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.12/235.71 [2019-03-28 12:42:40,542 INFO L93 Difference]: Finished difference Result 33 states and 175 transitions. 279.12/235.71 [2019-03-28 12:42:40,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.12/235.71 [2019-03-28 12:42:40,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 279.12/235.71 [2019-03-28 12:42:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.12/235.71 [2019-03-28 12:42:40,544 INFO L225 Difference]: With dead ends: 33 279.12/235.71 [2019-03-28 12:42:40,544 INFO L226 Difference]: Without dead ends: 32 279.12/235.71 [2019-03-28 12:42:40,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 279.12/235.71 [2019-03-28 12:42:40,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 279.12/235.71 [2019-03-28 12:42:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. 279.12/235.71 [2019-03-28 12:42:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 279.12/235.71 [2019-03-28 12:42:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 173 transitions. 279.12/235.71 [2019-03-28 12:42:40,549 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 173 transitions. Word has length 6 279.12/235.71 [2019-03-28 12:42:40,549 INFO L84 Accepts]: Finished accepts. word is rejected. 279.12/235.71 [2019-03-28 12:42:40,549 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 173 transitions. 279.12/235.71 [2019-03-28 12:42:40,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 279.12/235.71 [2019-03-28 12:42:40,549 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 173 transitions. 279.12/235.71 [2019-03-28 12:42:40,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 279.12/235.71 [2019-03-28 12:42:40,550 INFO L394 BasicCegarLoop]: Found error trace 279.12/235.71 [2019-03-28 12:42:40,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 279.12/235.71 [2019-03-28 12:42:40,550 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 279.12/235.71 [2019-03-28 12:42:40,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:42:40,550 INFO L82 PathProgramCache]: Analyzing trace with hash -161469545, now seen corresponding path program 1 times 279.12/235.71 [2019-03-28 12:42:40,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.71 [2019-03-28 12:42:40,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.71 [2019-03-28 12:42:40,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:40,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:40,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.71 [2019-03-28 12:42:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.71 [2019-03-28 12:42:40,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.12/235.71 [2019-03-28 12:42:40,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.12/235.71 [2019-03-28 12:42:40,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.12/235.71 [2019-03-28 12:42:40,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.12/235.71 [2019-03-28 12:42:40,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.71 [2019-03-28 12:42:40,575 INFO L87 Difference]: Start difference. First operand 32 states and 173 transitions. Second operand 3 states. 279.12/235.71 [2019-03-28 12:42:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.12/235.71 [2019-03-28 12:42:41,119 INFO L93 Difference]: Finished difference Result 33 states and 173 transitions. 279.12/235.71 [2019-03-28 12:42:41,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.12/235.71 [2019-03-28 12:42:41,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 279.12/235.71 [2019-03-28 12:42:41,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.12/235.71 [2019-03-28 12:42:41,120 INFO L225 Difference]: With dead ends: 33 279.12/235.71 [2019-03-28 12:42:41,121 INFO L226 Difference]: Without dead ends: 32 279.12/235.71 [2019-03-28 12:42:41,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.71 [2019-03-28 12:42:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 279.12/235.71 [2019-03-28 12:42:41,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. 279.12/235.71 [2019-03-28 12:42:41,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 279.12/235.71 [2019-03-28 12:42:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 172 transitions. 279.12/235.71 [2019-03-28 12:42:41,125 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 172 transitions. Word has length 6 279.12/235.71 [2019-03-28 12:42:41,125 INFO L84 Accepts]: Finished accepts. word is rejected. 279.12/235.71 [2019-03-28 12:42:41,125 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 172 transitions. 279.12/235.71 [2019-03-28 12:42:41,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.12/235.71 [2019-03-28 12:42:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 172 transitions. 279.12/235.71 [2019-03-28 12:42:41,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 279.12/235.71 [2019-03-28 12:42:41,126 INFO L394 BasicCegarLoop]: Found error trace 279.12/235.71 [2019-03-28 12:42:41,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 279.12/235.71 [2019-03-28 12:42:41,126 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 279.12/235.71 [2019-03-28 12:42:41,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:42:41,126 INFO L82 PathProgramCache]: Analyzing trace with hash -161469544, now seen corresponding path program 1 times 279.12/235.71 [2019-03-28 12:42:41,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.71 [2019-03-28 12:42:41,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.71 [2019-03-28 12:42:41,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:41,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:41,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.71 [2019-03-28 12:42:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.71 [2019-03-28 12:42:41,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.12/235.71 [2019-03-28 12:42:41,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.12/235.71 [2019-03-28 12:42:41,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.12/235.71 [2019-03-28 12:42:41,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.12/235.71 [2019-03-28 12:42:41,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.71 [2019-03-28 12:42:41,172 INFO L87 Difference]: Start difference. First operand 32 states and 172 transitions. Second operand 3 states. 279.12/235.71 [2019-03-28 12:42:41,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.12/235.71 [2019-03-28 12:42:41,780 INFO L93 Difference]: Finished difference Result 32 states and 172 transitions. 279.12/235.71 [2019-03-28 12:42:41,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.12/235.71 [2019-03-28 12:42:41,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 279.12/235.71 [2019-03-28 12:42:41,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.12/235.71 [2019-03-28 12:42:41,782 INFO L225 Difference]: With dead ends: 32 279.12/235.71 [2019-03-28 12:42:41,782 INFO L226 Difference]: Without dead ends: 31 279.12/235.71 [2019-03-28 12:42:41,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.71 [2019-03-28 12:42:41,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 279.12/235.71 [2019-03-28 12:42:41,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 279.12/235.71 [2019-03-28 12:42:41,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 279.12/235.71 [2019-03-28 12:42:41,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 171 transitions. 279.12/235.71 [2019-03-28 12:42:41,786 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 171 transitions. Word has length 6 279.12/235.71 [2019-03-28 12:42:41,786 INFO L84 Accepts]: Finished accepts. word is rejected. 279.12/235.71 [2019-03-28 12:42:41,786 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 171 transitions. 279.12/235.71 [2019-03-28 12:42:41,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.12/235.71 [2019-03-28 12:42:41,786 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 171 transitions. 279.12/235.71 [2019-03-28 12:42:41,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 279.12/235.71 [2019-03-28 12:42:41,787 INFO L394 BasicCegarLoop]: Found error trace 279.12/235.71 [2019-03-28 12:42:41,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 279.12/235.71 [2019-03-28 12:42:41,787 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 279.12/235.71 [2019-03-28 12:42:41,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:42:41,787 INFO L82 PathProgramCache]: Analyzing trace with hash -710586702, now seen corresponding path program 1 times 279.12/235.71 [2019-03-28 12:42:41,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.71 [2019-03-28 12:42:41,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.71 [2019-03-28 12:42:41,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:41,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:41,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.71 [2019-03-28 12:42:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.71 [2019-03-28 12:42:41,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.12/235.71 [2019-03-28 12:42:41,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.12/235.71 [2019-03-28 12:42:41,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.12/235.71 [2019-03-28 12:42:41,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.12/235.71 [2019-03-28 12:42:41,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.71 [2019-03-28 12:42:41,814 INFO L87 Difference]: Start difference. First operand 31 states and 171 transitions. Second operand 3 states. 279.12/235.71 [2019-03-28 12:42:42,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.12/235.71 [2019-03-28 12:42:42,382 INFO L93 Difference]: Finished difference Result 31 states and 171 transitions. 279.12/235.71 [2019-03-28 12:42:42,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.12/235.71 [2019-03-28 12:42:42,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 279.12/235.71 [2019-03-28 12:42:42,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.12/235.71 [2019-03-28 12:42:42,384 INFO L225 Difference]: With dead ends: 31 279.12/235.71 [2019-03-28 12:42:42,384 INFO L226 Difference]: Without dead ends: 28 279.12/235.71 [2019-03-28 12:42:42,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.71 [2019-03-28 12:42:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 279.12/235.71 [2019-03-28 12:42:42,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 279.12/235.71 [2019-03-28 12:42:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 279.12/235.71 [2019-03-28 12:42:42,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 165 transitions. 279.12/235.71 [2019-03-28 12:42:42,388 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 165 transitions. Word has length 7 279.12/235.71 [2019-03-28 12:42:42,388 INFO L84 Accepts]: Finished accepts. word is rejected. 279.12/235.71 [2019-03-28 12:42:42,388 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 165 transitions. 279.12/235.71 [2019-03-28 12:42:42,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.12/235.71 [2019-03-28 12:42:42,388 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 165 transitions. 279.12/235.71 [2019-03-28 12:42:42,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 279.12/235.71 [2019-03-28 12:42:42,389 INFO L394 BasicCegarLoop]: Found error trace 279.12/235.71 [2019-03-28 12:42:42,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 279.12/235.71 [2019-03-28 12:42:42,389 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 279.12/235.71 [2019-03-28 12:42:42,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:42:42,389 INFO L82 PathProgramCache]: Analyzing trace with hash -710586700, now seen corresponding path program 1 times 279.12/235.71 [2019-03-28 12:42:42,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.71 [2019-03-28 12:42:42,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.71 [2019-03-28 12:42:42,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:42,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:42,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.71 [2019-03-28 12:42:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.71 [2019-03-28 12:42:42,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.12/235.71 [2019-03-28 12:42:42,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.12/235.71 [2019-03-28 12:42:42,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.12/235.71 [2019-03-28 12:42:42,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.12/235.71 [2019-03-28 12:42:42,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.71 [2019-03-28 12:42:42,427 INFO L87 Difference]: Start difference. First operand 28 states and 165 transitions. Second operand 3 states. 279.12/235.71 [2019-03-28 12:42:42,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.12/235.71 [2019-03-28 12:42:42,982 INFO L93 Difference]: Finished difference Result 28 states and 165 transitions. 279.12/235.71 [2019-03-28 12:42:42,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.12/235.71 [2019-03-28 12:42:42,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 279.12/235.71 [2019-03-28 12:42:42,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.12/235.71 [2019-03-28 12:42:42,983 INFO L225 Difference]: With dead ends: 28 279.12/235.71 [2019-03-28 12:42:42,983 INFO L226 Difference]: Without dead ends: 25 279.12/235.71 [2019-03-28 12:42:42,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.71 [2019-03-28 12:42:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 279.12/235.71 [2019-03-28 12:42:42,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 279.12/235.71 [2019-03-28 12:42:42,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 279.12/235.71 [2019-03-28 12:42:42,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 159 transitions. 279.12/235.71 [2019-03-28 12:42:42,987 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 159 transitions. Word has length 7 279.12/235.71 [2019-03-28 12:42:42,987 INFO L84 Accepts]: Finished accepts. word is rejected. 279.12/235.71 [2019-03-28 12:42:42,987 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 159 transitions. 279.12/235.71 [2019-03-28 12:42:42,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.12/235.71 [2019-03-28 12:42:42,988 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 159 transitions. 279.12/235.71 [2019-03-28 12:42:42,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 279.12/235.71 [2019-03-28 12:42:42,988 INFO L394 BasicCegarLoop]: Found error trace 279.12/235.71 [2019-03-28 12:42:42,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 279.12/235.71 [2019-03-28 12:42:42,989 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 279.12/235.71 [2019-03-28 12:42:42,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:42:42,989 INFO L82 PathProgramCache]: Analyzing trace with hash 25809266, now seen corresponding path program 1 times 279.12/235.71 [2019-03-28 12:42:42,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.71 [2019-03-28 12:42:42,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.71 [2019-03-28 12:42:42,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:42,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:42,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.71 [2019-03-28 12:42:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.71 [2019-03-28 12:42:43,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.12/235.71 [2019-03-28 12:42:43,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.12/235.71 [2019-03-28 12:42:43,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.12/235.71 [2019-03-28 12:42:43,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.12/235.71 [2019-03-28 12:42:43,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.71 [2019-03-28 12:42:43,018 INFO L87 Difference]: Start difference. First operand 25 states and 159 transitions. Second operand 3 states. 279.12/235.71 [2019-03-28 12:42:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.12/235.71 [2019-03-28 12:42:43,557 INFO L93 Difference]: Finished difference Result 25 states and 159 transitions. 279.12/235.71 [2019-03-28 12:42:43,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.12/235.71 [2019-03-28 12:42:43,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 279.12/235.71 [2019-03-28 12:42:43,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.12/235.71 [2019-03-28 12:42:43,558 INFO L225 Difference]: With dead ends: 25 279.12/235.71 [2019-03-28 12:42:43,558 INFO L226 Difference]: Without dead ends: 24 279.12/235.71 [2019-03-28 12:42:43,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.71 [2019-03-28 12:42:43,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 279.12/235.71 [2019-03-28 12:42:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 279.12/235.71 [2019-03-28 12:42:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 279.12/235.71 [2019-03-28 12:42:43,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 157 transitions. 279.12/235.71 [2019-03-28 12:42:43,562 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 157 transitions. Word has length 9 279.12/235.71 [2019-03-28 12:42:43,562 INFO L84 Accepts]: Finished accepts. word is rejected. 279.12/235.71 [2019-03-28 12:42:43,562 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 157 transitions. 279.12/235.71 [2019-03-28 12:42:43,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.12/235.71 [2019-03-28 12:42:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 157 transitions. 279.12/235.71 [2019-03-28 12:42:43,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 279.12/235.71 [2019-03-28 12:42:43,563 INFO L394 BasicCegarLoop]: Found error trace 279.12/235.71 [2019-03-28 12:42:43,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 279.12/235.71 [2019-03-28 12:42:43,563 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 279.12/235.71 [2019-03-28 12:42:43,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:42:43,563 INFO L82 PathProgramCache]: Analyzing trace with hash 25809268, now seen corresponding path program 1 times 279.12/235.71 [2019-03-28 12:42:43,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.71 [2019-03-28 12:42:43,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.71 [2019-03-28 12:42:43,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:43,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:43,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.71 [2019-03-28 12:42:43,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.71 [2019-03-28 12:42:43,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.12/235.71 [2019-03-28 12:42:43,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.12/235.71 [2019-03-28 12:42:43,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.12/235.71 [2019-03-28 12:42:43,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.12/235.71 [2019-03-28 12:42:43,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.71 [2019-03-28 12:42:43,596 INFO L87 Difference]: Start difference. First operand 24 states and 157 transitions. Second operand 3 states. 279.12/235.71 [2019-03-28 12:42:44,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.12/235.71 [2019-03-28 12:42:44,188 INFO L93 Difference]: Finished difference Result 24 states and 157 transitions. 279.12/235.71 [2019-03-28 12:42:44,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.12/235.71 [2019-03-28 12:42:44,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 279.12/235.71 [2019-03-28 12:42:44,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.12/235.71 [2019-03-28 12:42:44,190 INFO L225 Difference]: With dead ends: 24 279.12/235.71 [2019-03-28 12:42:44,190 INFO L226 Difference]: Without dead ends: 23 279.12/235.71 [2019-03-28 12:42:44,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.71 [2019-03-28 12:42:44,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 279.12/235.71 [2019-03-28 12:42:44,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 279.12/235.71 [2019-03-28 12:42:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 279.12/235.71 [2019-03-28 12:42:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 155 transitions. 279.12/235.71 [2019-03-28 12:42:44,193 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 155 transitions. Word has length 9 279.12/235.71 [2019-03-28 12:42:44,193 INFO L84 Accepts]: Finished accepts. word is rejected. 279.12/235.71 [2019-03-28 12:42:44,193 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 155 transitions. 279.12/235.71 [2019-03-28 12:42:44,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.12/235.71 [2019-03-28 12:42:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 155 transitions. 279.12/235.71 [2019-03-28 12:42:44,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 279.12/235.71 [2019-03-28 12:42:44,194 INFO L394 BasicCegarLoop]: Found error trace 279.12/235.71 [2019-03-28 12:42:44,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 279.12/235.71 [2019-03-28 12:42:44,195 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 279.12/235.71 [2019-03-28 12:42:44,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:42:44,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1870026244, now seen corresponding path program 1 times 279.12/235.71 [2019-03-28 12:42:44,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.71 [2019-03-28 12:42:44,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.71 [2019-03-28 12:42:44,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:44,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:44,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.71 [2019-03-28 12:42:44,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.71 [2019-03-28 12:42:44,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.12/235.71 [2019-03-28 12:42:44,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.12/235.71 [2019-03-28 12:42:44,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.12/235.71 [2019-03-28 12:42:44,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.12/235.71 [2019-03-28 12:42:44,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.71 [2019-03-28 12:42:44,228 INFO L87 Difference]: Start difference. First operand 23 states and 155 transitions. Second operand 3 states. 279.12/235.71 [2019-03-28 12:42:44,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.12/235.71 [2019-03-28 12:42:44,804 INFO L93 Difference]: Finished difference Result 23 states and 155 transitions. 279.12/235.71 [2019-03-28 12:42:44,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.12/235.71 [2019-03-28 12:42:44,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 279.12/235.71 [2019-03-28 12:42:44,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.12/235.71 [2019-03-28 12:42:44,805 INFO L225 Difference]: With dead ends: 23 279.12/235.71 [2019-03-28 12:42:44,805 INFO L226 Difference]: Without dead ends: 22 279.12/235.71 [2019-03-28 12:42:44,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.71 [2019-03-28 12:42:44,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 279.12/235.71 [2019-03-28 12:42:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 279.12/235.71 [2019-03-28 12:42:44,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 279.12/235.71 [2019-03-28 12:42:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 153 transitions. 279.12/235.71 [2019-03-28 12:42:44,809 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 153 transitions. Word has length 13 279.12/235.71 [2019-03-28 12:42:44,809 INFO L84 Accepts]: Finished accepts. word is rejected. 279.12/235.71 [2019-03-28 12:42:44,809 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 153 transitions. 279.12/235.71 [2019-03-28 12:42:44,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.12/235.71 [2019-03-28 12:42:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 153 transitions. 279.12/235.71 [2019-03-28 12:42:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 279.12/235.71 [2019-03-28 12:42:44,810 INFO L394 BasicCegarLoop]: Found error trace 279.12/235.71 [2019-03-28 12:42:44,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 279.12/235.71 [2019-03-28 12:42:44,810 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 279.12/235.71 [2019-03-28 12:42:44,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:42:44,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1870026242, now seen corresponding path program 1 times 279.12/235.71 [2019-03-28 12:42:44,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.71 [2019-03-28 12:42:44,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.71 [2019-03-28 12:42:44,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:44,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:44,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.71 [2019-03-28 12:42:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.71 [2019-03-28 12:42:44,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.12/235.71 [2019-03-28 12:42:44,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.12/235.71 [2019-03-28 12:42:44,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.12/235.71 [2019-03-28 12:42:44,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.12/235.71 [2019-03-28 12:42:44,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.71 [2019-03-28 12:42:44,837 INFO L87 Difference]: Start difference. First operand 22 states and 153 transitions. Second operand 3 states. 279.12/235.71 [2019-03-28 12:42:45,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.12/235.71 [2019-03-28 12:42:45,429 INFO L93 Difference]: Finished difference Result 23 states and 153 transitions. 279.12/235.71 [2019-03-28 12:42:45,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.12/235.71 [2019-03-28 12:42:45,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 279.12/235.71 [2019-03-28 12:42:45,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.12/235.71 [2019-03-28 12:42:45,430 INFO L225 Difference]: With dead ends: 23 279.12/235.71 [2019-03-28 12:42:45,430 INFO L226 Difference]: Without dead ends: 22 279.12/235.71 [2019-03-28 12:42:45,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.71 [2019-03-28 12:42:45,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 279.12/235.71 [2019-03-28 12:42:45,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 279.12/235.71 [2019-03-28 12:42:45,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 279.12/235.71 [2019-03-28 12:42:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 152 transitions. 279.12/235.71 [2019-03-28 12:42:45,436 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 152 transitions. Word has length 13 279.12/235.71 [2019-03-28 12:42:45,436 INFO L84 Accepts]: Finished accepts. word is rejected. 279.12/235.71 [2019-03-28 12:42:45,436 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 152 transitions. 279.12/235.71 [2019-03-28 12:42:45,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.12/235.71 [2019-03-28 12:42:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 152 transitions. 279.12/235.71 [2019-03-28 12:42:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 279.12/235.71 [2019-03-28 12:42:45,437 INFO L394 BasicCegarLoop]: Found error trace 279.12/235.71 [2019-03-28 12:42:45,437 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 279.12/235.71 [2019-03-28 12:42:45,438 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 279.12/235.71 [2019-03-28 12:42:45,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:42:45,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1870026241, now seen corresponding path program 1 times 279.12/235.71 [2019-03-28 12:42:45,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.71 [2019-03-28 12:42:45,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.71 [2019-03-28 12:42:45,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:45,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:45,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.71 [2019-03-28 12:42:45,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.71 [2019-03-28 12:42:45,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.12/235.71 [2019-03-28 12:42:45,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 279.12/235.71 [2019-03-28 12:42:45,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 279.12/235.71 [2019-03-28 12:42:45,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.12/235.71 [2019-03-28 12:42:45,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.71 [2019-03-28 12:42:45,481 INFO L87 Difference]: Start difference. First operand 22 states and 152 transitions. Second operand 3 states. 279.12/235.71 [2019-03-28 12:42:46,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.12/235.71 [2019-03-28 12:42:46,035 INFO L93 Difference]: Finished difference Result 22 states and 152 transitions. 279.12/235.71 [2019-03-28 12:42:46,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.12/235.71 [2019-03-28 12:42:46,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 279.12/235.71 [2019-03-28 12:42:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 279.12/235.71 [2019-03-28 12:42:46,036 INFO L225 Difference]: With dead ends: 22 279.12/235.71 [2019-03-28 12:42:46,036 INFO L226 Difference]: Without dead ends: 0 279.12/235.71 [2019-03-28 12:42:46,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.71 [2019-03-28 12:42:46,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 279.12/235.71 [2019-03-28 12:42:46,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 279.12/235.71 [2019-03-28 12:42:46,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 279.12/235.71 [2019-03-28 12:42:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 279.12/235.71 [2019-03-28 12:42:46,038 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 279.12/235.71 [2019-03-28 12:42:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. 279.12/235.71 [2019-03-28 12:42:46,038 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 279.12/235.71 [2019-03-28 12:42:46,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 279.12/235.71 [2019-03-28 12:42:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 279.12/235.71 [2019-03-28 12:42:46,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 279.12/235.71 [2019-03-28 12:42:46,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 279.12/235.71 [2019-03-28 12:42:46,101 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,102 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,102 INFO L448 ceAbstractionStarter]: For program point L15-2(line 15) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,102 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,102 INFO L448 ceAbstractionStarter]: For program point L15-4(line 15) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,102 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,102 INFO L448 ceAbstractionStarter]: For program point L15-5(line 15) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,102 INFO L448 ceAbstractionStarter]: For program point L15-6(line 15) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,103 INFO L448 ceAbstractionStarter]: For program point L15-7(lines 15 19) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,103 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,103 INFO L444 ceAbstractionStarter]: At program point L15-9(lines 13 19) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_main_~M~0.base)) (= 0 ULTIMATE.start_main_~j~0.offset) (= (select |#length| ULTIMATE.start_main_~a~0.base) 4) (= ULTIMATE.start_main_~a~0.offset 0) (= (select |#length| ULTIMATE.start_main_~c~0.base) 4) (= 4 (select |#length| ULTIMATE.start_main_~i~0.base)) (= ULTIMATE.start_main_~b~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~b~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~c~0.base)) (= ULTIMATE.start_main_~N~0.offset 0) (= (select |#length| ULTIMATE.start_main_~M~0.base) 4) (= (select |#valid| ULTIMATE.start_main_~b~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_main_~N~0.base)) (= (select |#length| ULTIMATE.start_main_~N~0.base) 4) (= ULTIMATE.start_main_~M~0.offset 0) (= ULTIMATE.start_main_~c~0.offset 0) (= 1 (select |#valid| ULTIMATE.start_main_~j~0.base)) (= 0 ULTIMATE.start_main_~i~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~a~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~i~0.base)) (= (select |#length| ULTIMATE.start_main_~j~0.base) 4)) 279.12/235.71 [2019-03-28 12:42:46,103 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,103 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,104 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,105 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,105 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,105 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,105 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,106 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,106 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,106 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,106 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,106 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,106 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,106 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,106 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,107 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,107 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,107 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,107 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,107 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,107 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,107 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,107 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,107 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,108 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,108 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,108 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 279.12/235.71 [2019-03-28 12:42:46,108 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 279.12/235.71 [2019-03-28 12:42:46,120 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.71 [2019-03-28 12:42:46,121 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.71 [2019-03-28 12:42:46,121 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.71 [2019-03-28 12:42:46,122 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.71 [2019-03-28 12:42:46,122 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.71 [2019-03-28 12:42:46,122 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.71 [2019-03-28 12:42:46,122 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.71 [2019-03-28 12:42:46,130 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.71 [2019-03-28 12:42:46,131 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.71 [2019-03-28 12:42:46,131 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.71 [2019-03-28 12:42:46,131 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.71 [2019-03-28 12:42:46,132 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.71 [2019-03-28 12:42:46,132 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.71 [2019-03-28 12:42:46,132 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.71 [2019-03-28 12:42:46,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:42:46 BasicIcfg 279.12/235.71 [2019-03-28 12:42:46,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 279.12/235.71 [2019-03-28 12:42:46,136 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 279.12/235.71 [2019-03-28 12:42:46,136 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 279.12/235.71 [2019-03-28 12:42:46,140 INFO L276 PluginConnector]: BuchiAutomizer initialized 279.12/235.71 [2019-03-28 12:42:46,140 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 279.12/235.71 [2019-03-28 12:42:46,141 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:42:32" (1/5) ... 279.12/235.71 [2019-03-28 12:42:46,141 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16d753f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:42:46, skipping insertion in model container 279.12/235.71 [2019-03-28 12:42:46,141 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 279.12/235.71 [2019-03-28 12:42:46,141 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:33" (2/5) ... 279.12/235.71 [2019-03-28 12:42:46,142 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16d753f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:42:46, skipping insertion in model container 279.12/235.71 [2019-03-28 12:42:46,142 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 279.12/235.71 [2019-03-28 12:42:46,142 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:42:33" (3/5) ... 279.12/235.71 [2019-03-28 12:42:46,142 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16d753f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:42:46, skipping insertion in model container 279.12/235.71 [2019-03-28 12:42:46,142 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 279.12/235.71 [2019-03-28 12:42:46,143 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:42:34" (4/5) ... 279.12/235.71 [2019-03-28 12:42:46,143 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16d753f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:42:46, skipping insertion in model container 279.12/235.71 [2019-03-28 12:42:46,143 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 279.12/235.71 [2019-03-28 12:42:46,143 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:42:46" (5/5) ... 279.12/235.71 [2019-03-28 12:42:46,145 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 279.12/235.71 [2019-03-28 12:42:46,166 INFO L133 ementStrategyFactory]: Using default assertion order modulation 279.12/235.71 [2019-03-28 12:42:46,166 INFO L374 BuchiCegarLoop]: Interprodecural is true 279.12/235.71 [2019-03-28 12:42:46,166 INFO L375 BuchiCegarLoop]: Hoare is true 279.12/235.71 [2019-03-28 12:42:46,166 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 279.12/235.71 [2019-03-28 12:42:46,166 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 279.12/235.71 [2019-03-28 12:42:46,167 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 279.12/235.71 [2019-03-28 12:42:46,167 INFO L379 BuchiCegarLoop]: Difference is false 279.12/235.71 [2019-03-28 12:42:46,167 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 279.12/235.71 [2019-03-28 12:42:46,167 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 279.12/235.71 [2019-03-28 12:42:46,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states. 279.12/235.71 [2019-03-28 12:42:46,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 279.12/235.71 [2019-03-28 12:42:46,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 279.12/235.71 [2019-03-28 12:42:46,177 INFO L119 BuchiIsEmpty]: Starting construction of run 279.12/235.71 [2019-03-28 12:42:46,182 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 279.12/235.71 [2019-03-28 12:42:46,182 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 279.12/235.71 [2019-03-28 12:42:46,182 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 279.12/235.71 [2019-03-28 12:42:46,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states. 279.12/235.71 [2019-03-28 12:42:46,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 279.12/235.71 [2019-03-28 12:42:46,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 279.12/235.71 [2019-03-28 12:42:46,185 INFO L119 BuchiIsEmpty]: Starting construction of run 279.12/235.71 [2019-03-28 12:42:46,186 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 279.12/235.71 [2019-03-28 12:42:46,186 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 279.12/235.71 [2019-03-28 12:42:46,192 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue [105] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 10#L-1true [255] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse3 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1))) (let ((.cse5 (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_1| 1))) (let ((.cse4 (store .cse5 |v_ULTIMATE.start_main_#t~malloc4.base_1| 1))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_main_#t~malloc5.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~a~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc6.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| 0) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_1|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_1|) (= 0 (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~c~0.base_1 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~N~0.offset_1 |v_ULTIMATE.start_main_#t~malloc6.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc5.base_1| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= |v_#valid_3| (store .cse2 |v_ULTIMATE.start_main_#t~malloc6.base_1| 1)) (< |v_ULTIMATE.start_main_#t~malloc5.base_1| 0) (= (store (store (store (store (store (store (store |v_#length_8| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4) |v_ULTIMATE.start_main_#t~malloc3.base_1| 4) |v_ULTIMATE.start_main_#t~malloc4.base_1| 4) |v_ULTIMATE.start_main_#t~malloc5.base_1| 4) |v_ULTIMATE.start_main_#t~malloc6.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~b~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 (select .cse3 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (= (select .cse4 |v_ULTIMATE.start_main_#t~malloc5.base_1|) 0) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= (select .cse5 |v_ULTIMATE.start_main_#t~malloc4.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~N~0.base_1 |v_ULTIMATE.start_main_#t~malloc6.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_1|) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~b~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_1|) (= v_ULTIMATE.start_main_~c~0.offset_1 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~M~0.base_1 |v_ULTIMATE.start_main_#t~malloc5.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse2 |v_ULTIMATE.start_main_#t~malloc6.base_1|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= v_ULTIMATE.start_main_~M~0.offset_1 |v_ULTIMATE.start_main_#t~malloc5.offset_1|)))))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_1|, ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_1, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_~N~0.base=v_ULTIMATE.start_main_~N~0.base_1, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_1|, ULTIMATE.start_main_~M~0.offset=v_ULTIMATE.start_main_~M~0.offset_1, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_1|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_1|, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_1, ULTIMATE.start_main_~M~0.base=v_ULTIMATE.start_main_~M~0.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_1|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_1, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_1, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~N~0.offset=v_ULTIMATE.start_main_~N~0.offset_1, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_~c~0.base, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_~N~0.base, ULTIMATE.start_main_~c~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~M~0.offset, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_#t~short13, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~b~0.offset, ULTIMATE.start_main_~M~0.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_~b~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~N~0.offset, ULTIMATE.start_main_~j~0.base, ULTIMATE.start_main_#t~malloc5.offset] 26#L11true [106] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~i~0.base_4)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~i~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 22#L11-1true [364] L11-1-->L12: Formula: (and (= 1 (select |v_#valid_49| v_ULTIMATE.start_main_~a~0.base_7)) (<= 0 v_ULTIMATE.start_main_~a~0.offset_6) (<= (+ v_ULTIMATE.start_main_~a~0.offset_6 4) (select |v_#length_39| v_ULTIMATE.start_main_~a~0.base_7)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~a~0.base_7 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~a~0.base_7) v_ULTIMATE.start_main_~a~0.offset_6 |v_ULTIMATE.start_main_#t~mem7_6|)))) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_6, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_23|, #length=|v_#length_39|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_7} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_6, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_39|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 39#L12true [125] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_13| v_ULTIMATE.start_main_~j~0.base_4)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~j~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 38#L12-1true [365] L12-1-->L13: Formula: (and (<= (+ v_ULTIMATE.start_main_~b~0.offset_6 4) (select |v_#length_40| v_ULTIMATE.start_main_~b~0.base_7)) (<= 0 v_ULTIMATE.start_main_~b~0.offset_6) (= 1 (select |v_#valid_50| v_ULTIMATE.start_main_~b~0.base_7)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~b~0.base_7 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~b~0.base_7) v_ULTIMATE.start_main_~b~0.offset_6 |v_ULTIMATE.start_main_#t~mem8_6|)) |v_#memory_int_24|)) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_7, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_6, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_25|, #length=|v_#length_40|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_7, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_6, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_24|, #length=|v_#length_40|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 52#L13true [136] L13-->L15-9: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~c~0.base_4 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~c~0.base_4) v_ULTIMATE.start_main_~c~0.offset_4 0))) (<= (+ v_ULTIMATE.start_main_~c~0.offset_4 4) (select |v_#length_17| v_ULTIMATE.start_main_~c~0.base_4)) (<= 0 v_ULTIMATE.start_main_~c~0.offset_4) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~c~0.base_4))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_7|, #length=|v_#length_17|, #valid=|v_#valid_19|} AuxVars[] AssignedVars[#memory_int] 3#L15-9true 279.12/235.71 [2019-03-28 12:42:46,192 INFO L796 eck$LassoCheckResult]: Loop: 3#L15-9true [80] L15-9-->L15: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_7)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6) |v_ULTIMATE.start_main_#t~mem9_2|) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 15#L15true [96] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~M~0.offset_4 4) (select |v_#length_21| v_ULTIMATE.start_main_~M~0.base_4)) (= (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~M~0.base_4) v_ULTIMATE.start_main_~M~0.offset_4) |v_ULTIMATE.start_main_#t~mem10_2|) (= (select |v_#valid_23| v_ULTIMATE.start_main_~M~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~M~0.offset_4)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_21|, ULTIMATE.start_main_~M~0.base=v_ULTIMATE.start_main_~M~0.base_4, ULTIMATE.start_main_~M~0.offset=v_ULTIMATE.start_main_~M~0.offset_4, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~M~0.base=v_ULTIMATE.start_main_~M~0.base_4, ULTIMATE.start_main_~M~0.offset=v_ULTIMATE.start_main_~M~0.offset_4, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 30#L15-1true [328] L15-1-->L15-2: Formula: (and (>= |v_ULTIMATE.start_main_#t~mem9_3| |v_ULTIMATE.start_main_#t~mem10_3|) (not |v_ULTIMATE.start_main_#t~short13_2|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_3|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_3|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short13] 29#L15-2true [112] L15-2-->L15-7: Formula: |v_ULTIMATE.start_main_#t~short13_3| InVars {ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_3|} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_3|} AuxVars[] AssignedVars[] 7#L15-7true [90] L15-7-->L16: Formula: |v_ULTIMATE.start_main_#t~short13_9| InVars {ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_9|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_8|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~short13] 34#L16true [118] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem14_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_27| v_ULTIMATE.start_main_~i~0.base_10)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_27|, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_27|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 32#L16-1true [369] L16-1-->L17: Formula: (and (= 1 (select |v_#valid_57| v_ULTIMATE.start_main_~i~0.base_16)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem14_6| 1))) |v_#memory_int_26|) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_41| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_27|, #length=|v_#length_41|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_26|, #length=|v_#length_41|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem14] 45#L17true [133] L17-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_31| v_ULTIMATE.start_main_~j~0.base_10)) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_31|, #valid=|v_#valid_33|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_31|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 43#L17-1true [370] L17-1-->L18: Formula: (and (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_28|) (= 1 (select |v_#valid_58| v_ULTIMATE.start_main_~j~0.base_16)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_42| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_42|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_42|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 6#L18true [86] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~c~0.offset_6) (<= (+ v_ULTIMATE.start_main_~c~0.offset_6 4) (select |v_#length_35| v_ULTIMATE.start_main_~c~0.base_7)) (= (select |v_#valid_37| v_ULTIMATE.start_main_~c~0.base_7) 1) (= |v_ULTIMATE.start_main_#t~mem16_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_main_~c~0.base_7) v_ULTIMATE.start_main_~c~0.offset_6))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_7, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_6, #memory_int=|v_#memory_int_19|, #length=|v_#length_35|, #valid=|v_#valid_37|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_7, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_6, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, #length=|v_#length_35|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem16] 5#L18-1true [371] L18-1-->L15-9: Formula: (and (<= (+ v_ULTIMATE.start_main_~c~0.offset_10 4) (select |v_#length_43| v_ULTIMATE.start_main_~c~0.base_13)) (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~c~0.base_13 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~c~0.base_13) v_ULTIMATE.start_main_~c~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem16_6| 1))) |v_#memory_int_30|) (= 1 (select |v_#valid_59| v_ULTIMATE.start_main_~c~0.base_13)) (<= 0 v_ULTIMATE.start_main_~c~0.offset_10)) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_13, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_10, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_31|, #length=|v_#length_43|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_6|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_13, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_10, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_30|, #length=|v_#length_43|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem16] 3#L15-9true 279.12/235.71 [2019-03-28 12:42:46,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:42:46,194 INFO L82 PathProgramCache]: Analyzing trace with hash -739216033, now seen corresponding path program 1 times 279.12/235.71 [2019-03-28 12:42:46,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.71 [2019-03-28 12:42:46,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.71 [2019-03-28 12:42:46,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:46,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:46,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:42:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:42:46,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:42:46,258 INFO L82 PathProgramCache]: Analyzing trace with hash 197412198, now seen corresponding path program 1 times 279.12/235.71 [2019-03-28 12:42:46,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.71 [2019-03-28 12:42:46,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.71 [2019-03-28 12:42:46,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:46,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:46,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.71 [2019-03-28 12:42:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.71 [2019-03-28 12:42:46,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 279.12/235.71 [2019-03-28 12:42:46,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 279.12/235.71 [2019-03-28 12:42:46,269 INFO L811 eck$LassoCheckResult]: loop already infeasible 279.12/235.71 [2019-03-28 12:42:46,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 279.12/235.71 [2019-03-28 12:42:46,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 279.12/235.71 [2019-03-28 12:42:46,271 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. 279.12/235.71 [2019-03-28 12:42:47,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 279.12/235.71 [2019-03-28 12:42:47,009 INFO L93 Difference]: Finished difference Result 53 states and 212 transitions. 279.12/235.71 [2019-03-28 12:42:47,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 279.12/235.71 [2019-03-28 12:42:47,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 212 transitions. 279.12/235.71 [2019-03-28 12:42:47,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 279.12/235.71 [2019-03-28 12:42:47,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 22 states and 151 transitions. 279.12/235.71 [2019-03-28 12:42:47,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 279.12/235.71 [2019-03-28 12:42:47,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 279.12/235.71 [2019-03-28 12:42:47,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 151 transitions. 279.12/235.71 [2019-03-28 12:42:47,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 279.12/235.71 [2019-03-28 12:42:47,018 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 151 transitions. 279.12/235.71 [2019-03-28 12:42:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 151 transitions. 279.12/235.71 [2019-03-28 12:42:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 279.12/235.71 [2019-03-28 12:42:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 279.12/235.71 [2019-03-28 12:42:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 151 transitions. 279.12/235.71 [2019-03-28 12:42:47,021 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 151 transitions. 279.12/235.71 [2019-03-28 12:42:47,021 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 151 transitions. 279.12/235.71 [2019-03-28 12:42:47,021 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 279.12/235.71 [2019-03-28 12:42:47,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 151 transitions. 279.12/235.71 [2019-03-28 12:42:47,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 279.12/235.71 [2019-03-28 12:42:47,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 279.12/235.71 [2019-03-28 12:42:47,022 INFO L119 BuchiIsEmpty]: Starting construction of run 279.12/235.71 [2019-03-28 12:42:47,023 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 279.12/235.71 [2019-03-28 12:42:47,023 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 279.12/235.71 [2019-03-28 12:42:47,024 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY [105] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 124#L-1 [255] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse3 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1))) (let ((.cse5 (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_1| 1))) (let ((.cse4 (store .cse5 |v_ULTIMATE.start_main_#t~malloc4.base_1| 1))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_main_#t~malloc5.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~a~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc6.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| 0) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_1|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_1|) (= 0 (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~c~0.base_1 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~N~0.offset_1 |v_ULTIMATE.start_main_#t~malloc6.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc5.base_1| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= |v_#valid_3| (store .cse2 |v_ULTIMATE.start_main_#t~malloc6.base_1| 1)) (< |v_ULTIMATE.start_main_#t~malloc5.base_1| 0) (= (store (store (store (store (store (store (store |v_#length_8| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4) |v_ULTIMATE.start_main_#t~malloc3.base_1| 4) |v_ULTIMATE.start_main_#t~malloc4.base_1| 4) |v_ULTIMATE.start_main_#t~malloc5.base_1| 4) |v_ULTIMATE.start_main_#t~malloc6.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~b~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 (select .cse3 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (= (select .cse4 |v_ULTIMATE.start_main_#t~malloc5.base_1|) 0) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= (select .cse5 |v_ULTIMATE.start_main_#t~malloc4.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~N~0.base_1 |v_ULTIMATE.start_main_#t~malloc6.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_1|) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~b~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_1|) (= v_ULTIMATE.start_main_~c~0.offset_1 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~M~0.base_1 |v_ULTIMATE.start_main_#t~malloc5.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse2 |v_ULTIMATE.start_main_#t~malloc6.base_1|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= v_ULTIMATE.start_main_~M~0.offset_1 |v_ULTIMATE.start_main_#t~malloc5.offset_1|)))))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_1|, ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_1, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_~N~0.base=v_ULTIMATE.start_main_~N~0.base_1, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_1|, ULTIMATE.start_main_~M~0.offset=v_ULTIMATE.start_main_~M~0.offset_1, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_1|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_1|, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_1, ULTIMATE.start_main_~M~0.base=v_ULTIMATE.start_main_~M~0.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_1|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_1, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_1, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~N~0.offset=v_ULTIMATE.start_main_~N~0.offset_1, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_~c~0.base, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_~N~0.base, ULTIMATE.start_main_~c~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~M~0.offset, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_#t~short13, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~b~0.offset, ULTIMATE.start_main_~M~0.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_~b~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~N~0.offset, ULTIMATE.start_main_~j~0.base, ULTIMATE.start_main_#t~malloc5.offset] 125#L11 [106] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~i~0.base_4)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~i~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 127#L11-1 [364] L11-1-->L12: Formula: (and (= 1 (select |v_#valid_49| v_ULTIMATE.start_main_~a~0.base_7)) (<= 0 v_ULTIMATE.start_main_~a~0.offset_6) (<= (+ v_ULTIMATE.start_main_~a~0.offset_6 4) (select |v_#length_39| v_ULTIMATE.start_main_~a~0.base_7)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~a~0.base_7 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~a~0.base_7) v_ULTIMATE.start_main_~a~0.offset_6 |v_ULTIMATE.start_main_#t~mem7_6|)))) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_6, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_23|, #length=|v_#length_39|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_7} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_6, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_39|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 128#L12 [125] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_13| v_ULTIMATE.start_main_~j~0.base_4)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~j~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 130#L12-1 [365] L12-1-->L13: Formula: (and (<= (+ v_ULTIMATE.start_main_~b~0.offset_6 4) (select |v_#length_40| v_ULTIMATE.start_main_~b~0.base_7)) (<= 0 v_ULTIMATE.start_main_~b~0.offset_6) (= 1 (select |v_#valid_50| v_ULTIMATE.start_main_~b~0.base_7)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~b~0.base_7 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~b~0.base_7) v_ULTIMATE.start_main_~b~0.offset_6 |v_ULTIMATE.start_main_#t~mem8_6|)) |v_#memory_int_24|)) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_7, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_6, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_25|, #length=|v_#length_40|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_7, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_6, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_24|, #length=|v_#length_40|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 131#L13 [136] L13-->L15-9: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~c~0.base_4 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~c~0.base_4) v_ULTIMATE.start_main_~c~0.offset_4 0))) (<= (+ v_ULTIMATE.start_main_~c~0.offset_4 4) (select |v_#length_17| v_ULTIMATE.start_main_~c~0.base_4)) (<= 0 v_ULTIMATE.start_main_~c~0.offset_4) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~c~0.base_4))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_7|, #length=|v_#length_17|, #valid=|v_#valid_19|} AuxVars[] AssignedVars[#memory_int] 120#L15-9 279.12/235.71 [2019-03-28 12:42:47,025 INFO L796 eck$LassoCheckResult]: Loop: 120#L15-9 [80] L15-9-->L15: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_7)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6) |v_ULTIMATE.start_main_#t~mem9_2|) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 115#L15 [96] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~M~0.offset_4 4) (select |v_#length_21| v_ULTIMATE.start_main_~M~0.base_4)) (= (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~M~0.base_4) v_ULTIMATE.start_main_~M~0.offset_4) |v_ULTIMATE.start_main_#t~mem10_2|) (= (select |v_#valid_23| v_ULTIMATE.start_main_~M~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~M~0.offset_4)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_21|, ULTIMATE.start_main_~M~0.base=v_ULTIMATE.start_main_~M~0.base_4, ULTIMATE.start_main_~M~0.offset=v_ULTIMATE.start_main_~M~0.offset_4, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~M~0.base=v_ULTIMATE.start_main_~M~0.base_4, ULTIMATE.start_main_~M~0.offset=v_ULTIMATE.start_main_~M~0.offset_4, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 116#L15-1 [329] L15-1-->L15-2: Formula: (and |v_ULTIMATE.start_main_#t~short13_2| (< |v_ULTIMATE.start_main_#t~mem9_3| |v_ULTIMATE.start_main_#t~mem10_3|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_3|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_3|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short13] 134#L15-2 [112] L15-2-->L15-7: Formula: |v_ULTIMATE.start_main_#t~short13_3| InVars {ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_3|} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_3|} AuxVars[] AssignedVars[] 122#L15-7 [90] L15-7-->L16: Formula: |v_ULTIMATE.start_main_#t~short13_9| InVars {ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_9|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_8|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~short13] 119#L16 [118] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem14_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_27| v_ULTIMATE.start_main_~i~0.base_10)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_27|, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_27|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 113#L16-1 [369] L16-1-->L17: Formula: (and (= 1 (select |v_#valid_57| v_ULTIMATE.start_main_~i~0.base_16)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem14_6| 1))) |v_#memory_int_26|) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_41| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_27|, #length=|v_#length_41|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_26|, #length=|v_#length_41|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem14] 114#L17 [133] L17-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_31| v_ULTIMATE.start_main_~j~0.base_10)) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_31|, #valid=|v_#valid_33|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_31|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 117#L17-1 [370] L17-1-->L18: Formula: (and (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_28|) (= 1 (select |v_#valid_58| v_ULTIMATE.start_main_~j~0.base_16)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_42| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_42|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_42|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 118#L18 [86] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~c~0.offset_6) (<= (+ v_ULTIMATE.start_main_~c~0.offset_6 4) (select |v_#length_35| v_ULTIMATE.start_main_~c~0.base_7)) (= (select |v_#valid_37| v_ULTIMATE.start_main_~c~0.base_7) 1) (= |v_ULTIMATE.start_main_#t~mem16_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_main_~c~0.base_7) v_ULTIMATE.start_main_~c~0.offset_6))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_7, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_6, #memory_int=|v_#memory_int_19|, #length=|v_#length_35|, #valid=|v_#valid_37|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_7, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_6, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, #length=|v_#length_35|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem16] 121#L18-1 [371] L18-1-->L15-9: Formula: (and (<= (+ v_ULTIMATE.start_main_~c~0.offset_10 4) (select |v_#length_43| v_ULTIMATE.start_main_~c~0.base_13)) (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~c~0.base_13 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~c~0.base_13) v_ULTIMATE.start_main_~c~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem16_6| 1))) |v_#memory_int_30|) (= 1 (select |v_#valid_59| v_ULTIMATE.start_main_~c~0.base_13)) (<= 0 v_ULTIMATE.start_main_~c~0.offset_10)) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_13, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_10, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_31|, #length=|v_#length_43|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_6|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_13, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_10, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_30|, #length=|v_#length_43|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem16] 120#L15-9 279.12/235.71 [2019-03-28 12:42:47,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:42:47,025 INFO L82 PathProgramCache]: Analyzing trace with hash -739216033, now seen corresponding path program 2 times 279.12/235.71 [2019-03-28 12:42:47,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.71 [2019-03-28 12:42:47,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.71 [2019-03-28 12:42:47,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:47,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:47,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:42:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:42:47,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:42:47,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1610042265, now seen corresponding path program 1 times 279.12/235.71 [2019-03-28 12:42:47,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.71 [2019-03-28 12:42:47,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.71 [2019-03-28 12:42:47,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:47,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:47,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:42:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:42:47,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:42:47,079 INFO L82 PathProgramCache]: Analyzing trace with hash -102246327, now seen corresponding path program 1 times 279.12/235.71 [2019-03-28 12:42:47,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.71 [2019-03-28 12:42:47,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.71 [2019-03-28 12:42:47,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:47,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:47,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:42:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:42:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:42:47,229 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 74 279.12/235.71 [2019-03-28 12:42:48,527 WARN L188 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 163 DAG size of output: 135 279.12/235.71 [2019-03-28 12:42:48,927 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 125 279.12/235.71 [2019-03-28 12:42:48,942 INFO L216 LassoAnalysis]: Preferences: 279.12/235.71 [2019-03-28 12:42:48,943 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 279.12/235.71 [2019-03-28 12:42:48,943 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 279.12/235.71 [2019-03-28 12:42:48,943 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 279.12/235.71 [2019-03-28 12:42:48,943 INFO L127 ssoRankerPreferences]: Use exernal solver: false 279.12/235.71 [2019-03-28 12:42:48,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 279.12/235.71 [2019-03-28 12:42:48,944 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 279.12/235.71 [2019-03-28 12:42:48,944 INFO L130 ssoRankerPreferences]: Path of dumped script: 279.12/235.71 [2019-03-28 12:42:48,944 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 279.12/235.71 [2019-03-28 12:42:48,944 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 279.12/235.71 [2019-03-28 12:42:48,944 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 279.12/235.71 [2019-03-28 12:42:48,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:42:48,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:42:48,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:42:48,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:42:48,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:42:48,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:42:50,059 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 108 279.12/235.71 [2019-03-28 12:42:50,292 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 279.12/235.71 [2019-03-28 12:42:50,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:42:50,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:42:50,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:42:50,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:42:50,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:42:50,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:42:50,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:42:50,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:42:50,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:42:50,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:42:50,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:42:50,483 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 279.12/235.71 [2019-03-28 12:42:51,002 INFO L300 LassoAnalysis]: Preprocessing complete. 279.12/235.71 [2019-03-28 12:42:51,008 INFO L497 LassoAnalysis]: Using template 'affine'. 279.12/235.71 [2019-03-28 12:42:51,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:42:51,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:42:51,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:42:51,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:42:51,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:42:51,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:42:51,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:42:51,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:42:51,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:42:51,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:42:51,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:42:51,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:42:51,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:42:51,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:42:51,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:42:51,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:42:51,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:42:51,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:42:51,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:42:51,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:42:51,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:42:51,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:42:51,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:42:51,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:42:51,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:42:51,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:42:51,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:42:51,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:42:51,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:42:51,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:42:51,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:42:51,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:42:51,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:42:51,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:42:51,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:42:51,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:42:51,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:42:51,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:42:51,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:42:51,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:42:51,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:42:51,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:42:51,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:42:51,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:42:51,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:42:51,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:42:51,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:42:51,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:42:51,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:42:51,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:42:51,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:42:51,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:42:51,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:42:51,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:42:51,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:42:51,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:42:51,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:42:51,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:42:51,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:42:51,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:42:51,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:42:51,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:42:51,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:42:51,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:42:51,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:42:51,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:42:51,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:42:51,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:42:51,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:42:51,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:42:51,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:42:51,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:42:51,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:42:51,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:42:51,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:42:51,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:42:51,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:42:51,103 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 279.12/235.71 [2019-03-28 12:42:51,108 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 279.12/235.71 [2019-03-28 12:42:51,108 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 279.12/235.71 [2019-03-28 12:42:51,110 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 279.12/235.71 [2019-03-28 12:42:51,110 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 279.12/235.71 [2019-03-28 12:42:51,110 INFO L518 LassoAnalysis]: Proved termination. 279.12/235.71 [2019-03-28 12:42:51,111 INFO L520 LassoAnalysis]: Termination argument consisting of: 279.12/235.71 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~M~0.base) ULTIMATE.start_main_~M~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~M~0.base) ULTIMATE.start_main_~M~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1 279.12/235.71 Supporting invariants [] 279.12/235.71 [2019-03-28 12:42:51,640 INFO L297 tatePredicateManager]: 95 out of 97 supporting invariants were superfluous and have been removed 279.12/235.71 [2019-03-28 12:42:51,645 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 279.12/235.71 [2019-03-28 12:42:51,645 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 279.12/235.71 [2019-03-28 12:42:51,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:42:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.71 [2019-03-28 12:42:51,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 12 conjunts are in the unsatisfiable core 279.12/235.71 [2019-03-28 12:42:51,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.12/235.71 [2019-03-28 12:42:51,719 INFO L189 IndexEqualityManager]: detected not equals via solver 279.12/235.71 [2019-03-28 12:42:51,734 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 279.12/235.71 [2019-03-28 12:42:51,734 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:42:51,747 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.71 [2019-03-28 12:42:51,748 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:42:51,748 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 279.12/235.71 [2019-03-28 12:42:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.71 [2019-03-28 12:42:51,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjunts are in the unsatisfiable core 279.12/235.71 [2019-03-28 12:42:51,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.12/235.71 [2019-03-28 12:42:51,895 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.71 [2019-03-28 12:42:51,896 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 279.12/235.71 [2019-03-28 12:42:51,907 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:42:51,952 INFO L497 ElimStorePlain]: treesize reduction 37, result has 51.3 percent of original size 279.12/235.71 [2019-03-28 12:42:51,953 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:42:51,954 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 279.12/235.71 [2019-03-28 12:42:52,060 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.71 [2019-03-28 12:42:52,061 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 87 279.12/235.71 [2019-03-28 12:42:52,067 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:42:52,109 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.71 [2019-03-28 12:42:52,109 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 87 279.12/235.71 [2019-03-28 12:42:52,116 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:42:52,260 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 279.12/235.71 [2019-03-28 12:42:52,260 INFO L497 ElimStorePlain]: treesize reduction 70, result has 66.2 percent of original size 279.12/235.71 [2019-03-28 12:42:52,262 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 279.12/235.71 [2019-03-28 12:42:52,262 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:121 279.12/235.71 [2019-03-28 12:43:08,820 WARN L188 SmtUtils]: Spent 15.55 s on a formula simplification. DAG size of input: 50 DAG size of output: 28 279.12/235.71 [2019-03-28 12:43:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.71 [2019-03-28 12:43:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:43:09,115 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.12/235.71 [2019-03-28 12:43:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:43:09,126 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.12/235.71 [2019-03-28 12:43:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.71 [2019-03-28 12:43:09,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjunts are in the unsatisfiable core 279.12/235.71 [2019-03-28 12:43:09,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.12/235.71 [2019-03-28 12:43:09,209 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.71 [2019-03-28 12:43:09,210 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 82 279.12/235.71 [2019-03-28 12:43:09,221 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:43:09,302 INFO L497 ElimStorePlain]: treesize reduction 120, result has 32.2 percent of original size 279.12/235.71 [2019-03-28 12:43:09,303 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 279.12/235.71 [2019-03-28 12:43:09,303 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:51 279.12/235.71 [2019-03-28 12:43:18,555 WARN L188 SmtUtils]: Spent 3.64 s on a formula simplification that was a NOOP. DAG size: 34 279.12/235.71 [2019-03-28 12:43:19,577 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.71 [2019-03-28 12:43:19,578 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 82 279.12/235.71 [2019-03-28 12:43:19,590 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:43:19,655 INFO L497 ElimStorePlain]: treesize reduction 85, result has 40.1 percent of original size 279.12/235.71 [2019-03-28 12:43:19,656 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 279.12/235.71 [2019-03-28 12:43:19,657 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:51 279.12/235.71 [2019-03-28 12:43:32,812 WARN L188 SmtUtils]: Spent 3.64 s on a formula simplification that was a NOOP. DAG size: 34 279.12/235.71 [2019-03-28 12:43:33,805 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~j~0.offset Int)) (not (and (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~j~0.base) (= ULTIMATE.start_main_~j~0.offset c_ULTIMATE.start_main_~i~0.offset)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~M~0.base) c_ULTIMATE.start_main_~M~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~j~0.base) c_ULTIMATE.start_main_~i~0.offset) c_oldRank0))) is different from true 279.12/235.71 [2019-03-28 12:43:34,779 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~M~0.base) c_ULTIMATE.start_main_~M~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~c~0.base) c_ULTIMATE.start_main_~i~0.offset) c_oldRank0)) (exists ((ULTIMATE.start_main_~c~0.offset Int)) (not (and (= ULTIMATE.start_main_~c~0.offset c_ULTIMATE.start_main_~i~0.offset) (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~c~0.base))))) is different from true 279.12/235.71 [2019-03-28 12:43:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:43:34,794 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.12/235.71 [2019-03-28 12:43:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.71 [2019-03-28 12:43:34,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjunts are in the unsatisfiable core 279.12/235.71 [2019-03-28 12:43:34,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.12/235.71 [2019-03-28 12:43:34,879 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.71 [2019-03-28 12:43:34,880 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 82 279.12/235.71 [2019-03-28 12:43:34,889 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:43:35,004 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 279.12/235.71 [2019-03-28 12:43:35,005 INFO L497 ElimStorePlain]: treesize reduction 96, result has 37.3 percent of original size 279.12/235.71 [2019-03-28 12:43:35,006 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 279.12/235.71 [2019-03-28 12:43:35,006 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:51 279.12/235.71 [2019-03-28 12:43:35,045 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.71 [2019-03-28 12:43:35,045 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 279.12/235.71 [2019-03-28 12:43:35,050 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:43:35,091 INFO L497 ElimStorePlain]: treesize reduction 37, result has 51.3 percent of original size 279.12/235.71 [2019-03-28 12:43:35,091 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:43:35,092 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 279.12/235.71 [2019-03-28 12:43:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:43:35,106 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.12/235.71 [2019-03-28 12:43:35,106 INFO L98 LoopCannibalizer]: 12 predicates before loop cannibalization 19 predicates after loop cannibalization 279.12/235.71 [2019-03-28 12:43:35,110 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 19 loop predicates 279.12/235.71 [2019-03-28 12:43:35,111 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 22 states and 151 transitions. cyclomatic complexity: 130 Second operand 11 states. 279.12/235.71 [2019-03-28 12:43:59,168 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 22 states and 151 transitions. cyclomatic complexity: 130. Second operand 11 states. Result 478 states and 649 transitions. Complement of second has 218 states. 279.12/235.71 [2019-03-28 12:43:59,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 58 states 5 stem states 48 non-accepting loop states 5 accepting loop states 279.12/235.71 [2019-03-28 12:43:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 279.12/235.71 [2019-03-28 12:43:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 338 transitions. 279.12/235.71 [2019-03-28 12:43:59,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 338 transitions. Stem has 7 letters. Loop has 11 letters. 279.12/235.71 [2019-03-28 12:43:59,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. 279.12/235.71 [2019-03-28 12:43:59,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 338 transitions. Stem has 18 letters. Loop has 11 letters. 279.12/235.71 [2019-03-28 12:43:59,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. 279.12/235.71 [2019-03-28 12:43:59,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 338 transitions. Stem has 7 letters. Loop has 22 letters. 279.12/235.71 [2019-03-28 12:43:59,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. 279.12/235.71 [2019-03-28 12:43:59,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 478 states and 649 transitions. 279.12/235.71 [2019-03-28 12:43:59,232 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 133 279.12/235.71 [2019-03-28 12:43:59,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 478 states to 301 states and 450 transitions. 279.12/235.71 [2019-03-28 12:43:59,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 213 279.12/235.71 [2019-03-28 12:43:59,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 251 279.12/235.71 [2019-03-28 12:43:59,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 301 states and 450 transitions. 279.12/235.71 [2019-03-28 12:43:59,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 279.12/235.71 [2019-03-28 12:43:59,238 INFO L706 BuchiCegarLoop]: Abstraction has 301 states and 450 transitions. 279.12/235.71 [2019-03-28 12:43:59,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states and 450 transitions. 279.12/235.71 [2019-03-28 12:43:59,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 69. 279.12/235.71 [2019-03-28 12:43:59,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. 279.12/235.71 [2019-03-28 12:43:59,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 203 transitions. 279.12/235.71 [2019-03-28 12:43:59,244 INFO L729 BuchiCegarLoop]: Abstraction has 69 states and 203 transitions. 279.12/235.71 [2019-03-28 12:43:59,244 INFO L609 BuchiCegarLoop]: Abstraction has 69 states and 203 transitions. 279.12/235.71 [2019-03-28 12:43:59,244 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 279.12/235.71 [2019-03-28 12:43:59,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 203 transitions. 279.12/235.71 [2019-03-28 12:43:59,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 279.12/235.71 [2019-03-28 12:43:59,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 279.12/235.71 [2019-03-28 12:43:59,246 INFO L119 BuchiIsEmpty]: Starting construction of run 279.12/235.71 [2019-03-28 12:43:59,246 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 279.12/235.71 [2019-03-28 12:43:59,247 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 279.12/235.71 [2019-03-28 12:43:59,247 INFO L794 eck$LassoCheckResult]: Stem: 1528#ULTIMATE.startENTRY [105] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1521#L-1 [255] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse3 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1))) (let ((.cse5 (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_1| 1))) (let ((.cse4 (store .cse5 |v_ULTIMATE.start_main_#t~malloc4.base_1| 1))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_main_#t~malloc5.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~a~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc6.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| 0) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_1|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_1|) (= 0 (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~c~0.base_1 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~N~0.offset_1 |v_ULTIMATE.start_main_#t~malloc6.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc5.base_1| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= |v_#valid_3| (store .cse2 |v_ULTIMATE.start_main_#t~malloc6.base_1| 1)) (< |v_ULTIMATE.start_main_#t~malloc5.base_1| 0) (= (store (store (store (store (store (store (store |v_#length_8| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4) |v_ULTIMATE.start_main_#t~malloc3.base_1| 4) |v_ULTIMATE.start_main_#t~malloc4.base_1| 4) |v_ULTIMATE.start_main_#t~malloc5.base_1| 4) |v_ULTIMATE.start_main_#t~malloc6.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~b~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 (select .cse3 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (= (select .cse4 |v_ULTIMATE.start_main_#t~malloc5.base_1|) 0) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= (select .cse5 |v_ULTIMATE.start_main_#t~malloc4.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~N~0.base_1 |v_ULTIMATE.start_main_#t~malloc6.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_1|) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~b~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_1|) (= v_ULTIMATE.start_main_~c~0.offset_1 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~M~0.base_1 |v_ULTIMATE.start_main_#t~malloc5.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse2 |v_ULTIMATE.start_main_#t~malloc6.base_1|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= v_ULTIMATE.start_main_~M~0.offset_1 |v_ULTIMATE.start_main_#t~malloc5.offset_1|)))))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_1|, ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_1, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_~N~0.base=v_ULTIMATE.start_main_~N~0.base_1, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_1|, ULTIMATE.start_main_~M~0.offset=v_ULTIMATE.start_main_~M~0.offset_1, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_1|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_1|, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_1, ULTIMATE.start_main_~M~0.base=v_ULTIMATE.start_main_~M~0.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_1|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_1, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_1, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~N~0.offset=v_ULTIMATE.start_main_~N~0.offset_1, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_~c~0.base, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_~N~0.base, ULTIMATE.start_main_~c~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~M~0.offset, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_#t~short13, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~b~0.offset, ULTIMATE.start_main_~M~0.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_~b~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~N~0.offset, ULTIMATE.start_main_~j~0.base, ULTIMATE.start_main_#t~malloc5.offset] 1523#L11 [106] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~i~0.base_4)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~i~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 1543#L11-1 [364] L11-1-->L12: Formula: (and (= 1 (select |v_#valid_49| v_ULTIMATE.start_main_~a~0.base_7)) (<= 0 v_ULTIMATE.start_main_~a~0.offset_6) (<= (+ v_ULTIMATE.start_main_~a~0.offset_6 4) (select |v_#length_39| v_ULTIMATE.start_main_~a~0.base_7)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~a~0.base_7 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~a~0.base_7) v_ULTIMATE.start_main_~a~0.offset_6 |v_ULTIMATE.start_main_#t~mem7_6|)))) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_6, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_23|, #length=|v_#length_39|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_7} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_6, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_39|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 1542#L12 [125] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_13| v_ULTIMATE.start_main_~j~0.base_4)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~j~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 1541#L12-1 [365] L12-1-->L13: Formula: (and (<= (+ v_ULTIMATE.start_main_~b~0.offset_6 4) (select |v_#length_40| v_ULTIMATE.start_main_~b~0.base_7)) (<= 0 v_ULTIMATE.start_main_~b~0.offset_6) (= 1 (select |v_#valid_50| v_ULTIMATE.start_main_~b~0.base_7)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~b~0.base_7 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~b~0.base_7) v_ULTIMATE.start_main_~b~0.offset_6 |v_ULTIMATE.start_main_#t~mem8_6|)) |v_#memory_int_24|)) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_7, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_6, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_25|, #length=|v_#length_40|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_7, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_6, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_24|, #length=|v_#length_40|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 1540#L13 [136] L13-->L15-9: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~c~0.base_4 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~c~0.base_4) v_ULTIMATE.start_main_~c~0.offset_4 0))) (<= (+ v_ULTIMATE.start_main_~c~0.offset_4 4) (select |v_#length_17| v_ULTIMATE.start_main_~c~0.base_4)) (<= 0 v_ULTIMATE.start_main_~c~0.offset_4) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~c~0.base_4))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_7|, #length=|v_#length_17|, #valid=|v_#valid_19|} AuxVars[] AssignedVars[#memory_int] 1539#L15-9 [80] L15-9-->L15: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_7)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6) |v_ULTIMATE.start_main_#t~mem9_2|) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1498#L15 279.12/235.71 [2019-03-28 12:43:59,248 INFO L796 eck$LassoCheckResult]: Loop: 1498#L15 [96] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~M~0.offset_4 4) (select |v_#length_21| v_ULTIMATE.start_main_~M~0.base_4)) (= (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~M~0.base_4) v_ULTIMATE.start_main_~M~0.offset_4) |v_ULTIMATE.start_main_#t~mem10_2|) (= (select |v_#valid_23| v_ULTIMATE.start_main_~M~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~M~0.offset_4)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_21|, ULTIMATE.start_main_~M~0.base=v_ULTIMATE.start_main_~M~0.base_4, ULTIMATE.start_main_~M~0.offset=v_ULTIMATE.start_main_~M~0.offset_4, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~M~0.base=v_ULTIMATE.start_main_~M~0.base_4, ULTIMATE.start_main_~M~0.offset=v_ULTIMATE.start_main_~M~0.offset_4, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 1499#L15-1 [328] L15-1-->L15-2: Formula: (and (>= |v_ULTIMATE.start_main_#t~mem9_3| |v_ULTIMATE.start_main_#t~mem10_3|) (not |v_ULTIMATE.start_main_#t~short13_2|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_3|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_3|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short13] 1566#L15-2 [113] L15-2-->L15-4: Formula: (not |v_ULTIMATE.start_main_#t~short13_4|) InVars {ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_4|} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_4|} AuxVars[] AssignedVars[] 1565#L15-4 [109] L15-4-->L15-5: Formula: (and (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_23| v_ULTIMATE.start_main_~j~0.base_7)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~j~0.base_7))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_23|, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 1564#L15-5 [102] L15-5-->L15-6: Formula: (and (= 1 (select |v_#valid_27| v_ULTIMATE.start_main_~N~0.base_4)) (<= (+ v_ULTIMATE.start_main_~N~0.offset_4 4) (select |v_#length_25| v_ULTIMATE.start_main_~N~0.base_4)) (<= 0 v_ULTIMATE.start_main_~N~0.offset_4) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~N~0.base_4) v_ULTIMATE.start_main_~N~0.offset_4) |v_ULTIMATE.start_main_#t~mem12_2|)) InVars {ULTIMATE.start_main_~N~0.offset=v_ULTIMATE.start_main_~N~0.offset_4, #memory_int=|v_#memory_int_12|, #length=|v_#length_25|, ULTIMATE.start_main_~N~0.base=v_ULTIMATE.start_main_~N~0.base_4, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_2|, #valid=|v_#valid_27|, ULTIMATE.start_main_~N~0.offset=v_ULTIMATE.start_main_~N~0.offset_4, #memory_int=|v_#memory_int_12|, #length=|v_#length_25|, ULTIMATE.start_main_~N~0.base=v_ULTIMATE.start_main_~N~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12] 1563#L15-6 [347] L15-6-->L15-7: Formula: (and (< |v_ULTIMATE.start_main_#t~mem11_3| |v_ULTIMATE.start_main_#t~mem12_3|) |v_ULTIMATE.start_main_#t~short13_5|) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_3|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_3|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_3|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_5|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short13] 1562#L15-7 [90] L15-7-->L16: Formula: |v_ULTIMATE.start_main_#t~short13_9| InVars {ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_9|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_8|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~short13] 1561#L16 [118] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem14_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_27| v_ULTIMATE.start_main_~i~0.base_10)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_27|, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_27|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 1560#L16-1 [369] L16-1-->L17: Formula: (and (= 1 (select |v_#valid_57| v_ULTIMATE.start_main_~i~0.base_16)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem14_6| 1))) |v_#memory_int_26|) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_41| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_27|, #length=|v_#length_41|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_26|, #length=|v_#length_41|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem14] 1559#L17 [133] L17-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_31| v_ULTIMATE.start_main_~j~0.base_10)) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_31|, #valid=|v_#valid_33|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_31|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 1547#L17-1 [370] L17-1-->L18: Formula: (and (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_28|) (= 1 (select |v_#valid_58| v_ULTIMATE.start_main_~j~0.base_16)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_42| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_42|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_42|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 1558#L18 [86] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~c~0.offset_6) (<= (+ v_ULTIMATE.start_main_~c~0.offset_6 4) (select |v_#length_35| v_ULTIMATE.start_main_~c~0.base_7)) (= (select |v_#valid_37| v_ULTIMATE.start_main_~c~0.base_7) 1) (= |v_ULTIMATE.start_main_#t~mem16_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_main_~c~0.base_7) v_ULTIMATE.start_main_~c~0.offset_6))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_7, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_6, #memory_int=|v_#memory_int_19|, #length=|v_#length_35|, #valid=|v_#valid_37|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_7, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_6, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, #length=|v_#length_35|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem16] 1514#L18-1 [371] L18-1-->L15-9: Formula: (and (<= (+ v_ULTIMATE.start_main_~c~0.offset_10 4) (select |v_#length_43| v_ULTIMATE.start_main_~c~0.base_13)) (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~c~0.base_13 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~c~0.base_13) v_ULTIMATE.start_main_~c~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem16_6| 1))) |v_#memory_int_30|) (= 1 (select |v_#valid_59| v_ULTIMATE.start_main_~c~0.base_13)) (<= 0 v_ULTIMATE.start_main_~c~0.offset_10)) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_13, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_10, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_31|, #length=|v_#length_43|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_6|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_13, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_10, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_30|, #length=|v_#length_43|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem16] 1512#L15-9 [80] L15-9-->L15: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_7)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6) |v_ULTIMATE.start_main_#t~mem9_2|) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 1498#L15 279.12/235.71 [2019-03-28 12:43:59,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:43:59,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1440860463, now seen corresponding path program 1 times 279.12/235.71 [2019-03-28 12:43:59,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.71 [2019-03-28 12:43:59,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.71 [2019-03-28 12:43:59,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:43:59,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:43:59,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:43:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:43:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:43:59,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:43:59,281 INFO L82 PathProgramCache]: Analyzing trace with hash 581446123, now seen corresponding path program 1 times 279.12/235.71 [2019-03-28 12:43:59,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.71 [2019-03-28 12:43:59,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.71 [2019-03-28 12:43:59,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:43:59,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:43:59,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:43:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:43:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:43:59,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:43:59,296 INFO L82 PathProgramCache]: Analyzing trace with hash 183907515, now seen corresponding path program 1 times 279.12/235.71 [2019-03-28 12:43:59,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.71 [2019-03-28 12:43:59,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.71 [2019-03-28 12:43:59,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:43:59,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:43:59,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:43:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:43:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:43:59,495 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 96 279.12/235.71 [2019-03-28 12:44:00,740 WARN L188 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 167 DAG size of output: 142 279.12/235.71 [2019-03-28 12:44:01,195 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 132 279.12/235.71 [2019-03-28 12:44:01,201 INFO L216 LassoAnalysis]: Preferences: 279.12/235.71 [2019-03-28 12:44:01,201 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 279.12/235.71 [2019-03-28 12:44:01,201 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 279.12/235.71 [2019-03-28 12:44:01,201 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 279.12/235.71 [2019-03-28 12:44:01,201 INFO L127 ssoRankerPreferences]: Use exernal solver: false 279.12/235.71 [2019-03-28 12:44:01,201 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 279.12/235.71 [2019-03-28 12:44:01,201 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 279.12/235.71 [2019-03-28 12:44:01,202 INFO L130 ssoRankerPreferences]: Path of dumped script: 279.12/235.71 [2019-03-28 12:44:01,202 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 279.12/235.71 [2019-03-28 12:44:01,202 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 279.12/235.71 [2019-03-28 12:44:01,202 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 279.12/235.71 [2019-03-28 12:44:01,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:44:01,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:44:01,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:44:01,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:44:01,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:44:01,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:44:01,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:44:01,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:44:01,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:44:01,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:44:01,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:44:01,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:44:01,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:44:01,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:44:01,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:44:02,571 WARN L188 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 119 279.12/235.71 [2019-03-28 12:44:02,922 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 119 279.12/235.71 [2019-03-28 12:44:03,649 INFO L300 LassoAnalysis]: Preprocessing complete. 279.12/235.71 [2019-03-28 12:44:03,656 INFO L497 LassoAnalysis]: Using template 'affine'. 279.12/235.71 [2019-03-28 12:44:03,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:44:03,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:44:03,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:44:03,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:44:03,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:44:03,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:44:03,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:44:03,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:44:03,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:44:03,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:44:03,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:44:03,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:44:03,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:44:03,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:44:03,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:44:03,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:44:03,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:44:03,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:44:03,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:44:03,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:44:03,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:44:03,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:44:03,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:44:03,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:44:03,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:44:03,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:44:03,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:44:03,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:44:03,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:44:03,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:44:03,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:44:03,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:44:03,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:44:03,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:44:03,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:44:03,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:44:03,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:44:03,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:44:03,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:44:03,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:44:03,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:44:03,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:44:03,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:44:03,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:44:03,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:44:03,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:44:03,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:44:03,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:44:03,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:44:03,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:44:03,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:44:03,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:44:03,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:44:03,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:44:03,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:44:03,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:44:03,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:44:03,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:44:03,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:44:03,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:44:03,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:44:03,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:44:03,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:44:03,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:44:03,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:44:03,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:44:03,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:44:03,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:44:03,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:44:03,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:44:03,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:44:03,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:44:03,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:44:03,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:44:03,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:44:03,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:44:03,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:44:03,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:44:03,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:44:03,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:44:03,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:44:03,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:44:03,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:44:03,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:44:03,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:44:03,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:44:03,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:44:03,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:44:03,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:44:03,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:44:03,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:44:03,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:44:03,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:44:03,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:44:03,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:44:03,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:44:03,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:44:03,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:44:03,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:44:03,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:44:03,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:44:03,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:44:03,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:44:03,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:44:03,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:44:03,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:44:03,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:44:03,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:44:03,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:44:03,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:44:03,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:44:03,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:44:03,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:44:03,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:44:03,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:44:03,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:44:03,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:44:03,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:44:03,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:44:03,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:44:03,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:44:03,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:44:03,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:44:03,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:44:03,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:44:03,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:44:03,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:44:03,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:44:03,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:44:03,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:44:03,694 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 279.12/235.71 [2019-03-28 12:44:03,696 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 279.12/235.71 [2019-03-28 12:44:03,696 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 279.12/235.71 [2019-03-28 12:44:03,696 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 279.12/235.71 [2019-03-28 12:44:03,697 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 279.12/235.71 [2019-03-28 12:44:03,697 INFO L518 LassoAnalysis]: Proved termination. 279.12/235.71 [2019-03-28 12:44:03,697 INFO L520 LassoAnalysis]: Termination argument consisting of: 279.12/235.71 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_main_~N~0.base) ULTIMATE.start_main_~N~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~N~0.base) ULTIMATE.start_main_~N~0.offset)_1 279.12/235.71 Supporting invariants [] 279.12/235.71 [2019-03-28 12:44:04,416 INFO L297 tatePredicateManager]: 121 out of 124 supporting invariants were superfluous and have been removed 279.12/235.71 [2019-03-28 12:44:04,422 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 279.12/235.71 [2019-03-28 12:44:04,422 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 279.12/235.71 [2019-03-28 12:44:04,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:44:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.71 [2019-03-28 12:44:04,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core 279.12/235.71 [2019-03-28 12:44:04,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.12/235.71 [2019-03-28 12:44:04,477 INFO L189 IndexEqualityManager]: detected not equals via solver 279.12/235.71 [2019-03-28 12:44:04,478 INFO L189 IndexEqualityManager]: detected not equals via solver 279.12/235.71 [2019-03-28 12:44:04,479 INFO L189 IndexEqualityManager]: detected not equals via solver 279.12/235.71 [2019-03-28 12:44:04,481 INFO L189 IndexEqualityManager]: detected not equals via solver 279.12/235.71 [2019-03-28 12:44:04,482 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 279.12/235.71 [2019-03-28 12:44:04,483 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:44:04,501 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.71 [2019-03-28 12:44:04,502 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:44:04,502 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:16 279.12/235.71 [2019-03-28 12:44:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.71 [2019-03-28 12:44:04,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core 279.12/235.71 [2019-03-28 12:44:04,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.12/235.71 [2019-03-28 12:44:04,660 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.71 [2019-03-28 12:44:04,661 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 87 279.12/235.71 [2019-03-28 12:44:04,668 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:44:04,742 INFO L497 ElimStorePlain]: treesize reduction 67, result has 53.5 percent of original size 279.12/235.71 [2019-03-28 12:44:04,744 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 279.12/235.71 [2019-03-28 12:44:04,744 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:70 279.12/235.71 [2019-03-28 12:44:09,238 WARN L188 SmtUtils]: Spent 2.57 s on a formula simplification that was a NOOP. DAG size: 39 279.12/235.71 [2019-03-28 12:44:10,257 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.71 [2019-03-28 12:44:10,258 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 79 279.12/235.71 [2019-03-28 12:44:10,262 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:44:10,271 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 279.12/235.71 [2019-03-28 12:44:10,272 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:44:10,320 INFO L497 ElimStorePlain]: treesize reduction 76, result has 35.6 percent of original size 279.12/235.71 [2019-03-28 12:44:10,321 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:44:10,321 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:38 279.12/235.71 [2019-03-28 12:44:10,431 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.71 [2019-03-28 12:44:10,432 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 90 279.12/235.71 [2019-03-28 12:44:10,436 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:44:10,482 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.71 [2019-03-28 12:44:10,483 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 90 279.12/235.71 [2019-03-28 12:44:10,487 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:44:10,616 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 279.12/235.71 [2019-03-28 12:44:10,616 INFO L497 ElimStorePlain]: treesize reduction 103, result has 54.6 percent of original size 279.12/235.71 [2019-03-28 12:44:10,617 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 279.12/235.71 [2019-03-28 12:44:10,618 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:109, output treesize:106 279.12/235.71 [2019-03-28 12:44:29,671 WARN L188 SmtUtils]: Spent 13.39 s on a formula simplification. DAG size of input: 50 DAG size of output: 42 279.12/235.71 [2019-03-28 12:44:29,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.71 [2019-03-28 12:44:30,798 WARN L860 $PredicateComparison]: unable to prove that (or (<= 1 c_oldRank0) (exists ((ULTIMATE.start_main_~i~0.offset Int)) (not (and (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~j~0.base) (= c_ULTIMATE.start_main_~j~0.offset ULTIMATE.start_main_~i~0.offset))))) is different from true 279.12/235.71 [2019-03-28 12:44:31,791 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~N~0.base) c_ULTIMATE.start_main_~N~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~j~0.offset) c_oldRank0)) (exists ((ULTIMATE.start_main_~i~0.offset Int)) (not (and (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~j~0.base) (= c_ULTIMATE.start_main_~j~0.offset ULTIMATE.start_main_~i~0.offset))))) is different from true 279.12/235.71 [2019-03-28 12:44:32,825 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_main_~j~0.base c_ULTIMATE.start_main_~c~0.base) (= ULTIMATE.start_main_~c~0.offset c_ULTIMATE.start_main_~j~0.offset)))) (not (= c_ULTIMATE.start_main_~N~0.base c_ULTIMATE.start_main_~j~0.base))) is different from true 279.12/235.71 [2019-03-28 12:44:33,995 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_main_~j~0.base c_ULTIMATE.start_main_~c~0.base) (= ULTIMATE.start_main_~c~0.offset c_ULTIMATE.start_main_~j~0.offset)))) (exists ((v_prenex_2 Int)) (not (and (= v_prenex_2 c_ULTIMATE.start_main_~j~0.offset) (= c_ULTIMATE.start_main_~j~0.base c_ULTIMATE.start_main_~c~0.base))))) is different from true 279.12/235.71 [2019-03-28 12:44:34,864 WARN L860 $PredicateComparison]: unable to prove that (or (not (= c_ULTIMATE.start_main_~N~0.offset c_ULTIMATE.start_main_~j~0.offset)) (exists ((v_prenex_2 Int)) (not (and (= v_prenex_2 c_ULTIMATE.start_main_~j~0.offset) (= c_ULTIMATE.start_main_~j~0.base c_ULTIMATE.start_main_~c~0.base))))) is different from true 279.12/235.71 [2019-03-28 12:44:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:44:34,878 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.12/235.71 [2019-03-28 12:44:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:44:34,890 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.12/235.71 [2019-03-28 12:44:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:44:34,904 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.12/235.71 [2019-03-28 12:44:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.71 [2019-03-28 12:44:34,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core 279.12/235.71 [2019-03-28 12:44:34,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.12/235.71 [2019-03-28 12:44:34,987 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.71 [2019-03-28 12:44:34,987 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 279.12/235.71 [2019-03-28 12:44:34,990 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:44:35,035 INFO L497 ElimStorePlain]: treesize reduction 43, result has 49.4 percent of original size 279.12/235.71 [2019-03-28 12:44:35,036 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:44:35,036 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:38 279.12/235.71 [2019-03-28 12:44:35,139 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 279.12/235.71 [2019-03-28 12:44:35,140 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:44:35,175 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.71 [2019-03-28 12:44:35,175 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 95 279.12/235.71 [2019-03-28 12:44:35,182 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:44:35,291 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 279.12/235.71 [2019-03-28 12:44:35,292 INFO L497 ElimStorePlain]: treesize reduction 123, result has 43.6 percent of original size 279.12/235.71 [2019-03-28 12:44:35,293 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 279.12/235.71 [2019-03-28 12:44:35,293 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:89, output treesize:78 279.12/235.71 [2019-03-28 12:44:41,178 WARN L188 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 44 DAG size of output: 36 279.12/235.71 [2019-03-28 12:44:47,821 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_main_~j~0.base c_ULTIMATE.start_main_~c~0.base) (= ULTIMATE.start_main_~c~0.offset c_ULTIMATE.start_main_~j~0.offset)))) (<= 0 c_oldRank0)) is different from true 279.12/235.71 [2019-03-28 12:44:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:44:47,837 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.12/235.71 [2019-03-28 12:44:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.71 [2019-03-28 12:44:47,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core 279.12/235.71 [2019-03-28 12:44:47,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.12/235.71 [2019-03-28 12:44:47,932 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.71 [2019-03-28 12:44:47,933 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 82 279.12/235.71 [2019-03-28 12:44:47,940 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:44:48,038 INFO L497 ElimStorePlain]: treesize reduction 84, result has 41.7 percent of original size 279.12/235.71 [2019-03-28 12:44:48,039 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 279.12/235.71 [2019-03-28 12:44:48,039 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:54 279.12/235.71 [2019-03-28 12:45:01,199 WARN L188 SmtUtils]: Spent 3.67 s on a formula simplification that was a NOOP. DAG size: 36 279.12/235.71 [2019-03-28 12:45:01,237 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.71 [2019-03-28 12:45:01,238 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 87 279.12/235.71 [2019-03-28 12:45:01,244 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:45:01,320 INFO L497 ElimStorePlain]: treesize reduction 67, result has 53.5 percent of original size 279.12/235.71 [2019-03-28 12:45:01,321 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 279.12/235.71 [2019-03-28 12:45:01,321 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:70 279.12/235.71 [2019-03-28 12:45:02,241 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~N~0.base) c_ULTIMATE.start_main_~N~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~c~0.base) c_ULTIMATE.start_main_~j~0.offset) c_oldRank0)) (exists ((ULTIMATE.start_main_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_main_~j~0.base c_ULTIMATE.start_main_~c~0.base) (= ULTIMATE.start_main_~c~0.offset c_ULTIMATE.start_main_~j~0.offset))))) is different from true 279.12/235.71 [2019-03-28 12:45:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:45:02,335 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.12/235.71 [2019-03-28 12:45:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.71 [2019-03-28 12:45:02,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core 279.12/235.71 [2019-03-28 12:45:02,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.12/235.71 [2019-03-28 12:45:02,381 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.71 [2019-03-28 12:45:02,382 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 87 279.12/235.71 [2019-03-28 12:45:02,389 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:45:02,475 INFO L497 ElimStorePlain]: treesize reduction 81, result has 48.7 percent of original size 279.12/235.71 [2019-03-28 12:45:02,476 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 279.12/235.71 [2019-03-28 12:45:02,477 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:70 279.12/235.71 [2019-03-28 12:45:02,519 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.71 [2019-03-28 12:45:02,520 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 79 279.12/235.71 [2019-03-28 12:45:02,522 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:45:02,532 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 279.12/235.71 [2019-03-28 12:45:02,532 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:45:02,591 INFO L497 ElimStorePlain]: treesize reduction 65, result has 38.7 percent of original size 279.12/235.71 [2019-03-28 12:45:02,591 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.12/235.71 [2019-03-28 12:45:02,592 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:38 279.12/235.71 [2019-03-28 12:45:02,595 INFO L98 LoopCannibalizer]: 25 predicates before loop cannibalization 32 predicates after loop cannibalization 279.12/235.71 [2019-03-28 12:45:02,596 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 32 loop predicates 279.12/235.71 [2019-03-28 12:45:02,596 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 69 states and 203 transitions. cyclomatic complexity: 137 Second operand 13 states. 279.12/235.71 [2019-03-28 12:45:32,170 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 69 states and 203 transitions. cyclomatic complexity: 137. Second operand 13 states. Result 1438 states and 1689 transitions. Complement of second has 259 states. 279.12/235.71 [2019-03-28 12:45:32,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 34 states 3 stem states 28 non-accepting loop states 3 accepting loop states 279.12/235.71 [2019-03-28 12:45:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 279.12/235.71 [2019-03-28 12:45:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 240 transitions. 279.12/235.71 [2019-03-28 12:45:32,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 240 transitions. Stem has 8 letters. Loop has 14 letters. 279.12/235.71 [2019-03-28 12:45:32,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. 279.12/235.71 [2019-03-28 12:45:32,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 240 transitions. Stem has 22 letters. Loop has 14 letters. 279.12/235.71 [2019-03-28 12:45:32,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. 279.12/235.71 [2019-03-28 12:45:32,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 240 transitions. Stem has 8 letters. Loop has 28 letters. 279.12/235.71 [2019-03-28 12:45:32,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. 279.12/235.71 [2019-03-28 12:45:32,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1438 states and 1689 transitions. 279.12/235.71 [2019-03-28 12:45:32,234 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 44 279.12/235.71 [2019-03-28 12:45:32,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1438 states to 222 states and 337 transitions. 279.12/235.71 [2019-03-28 12:45:32,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 279.12/235.71 [2019-03-28 12:45:32,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 279.12/235.71 [2019-03-28 12:45:32,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 337 transitions. 279.12/235.71 [2019-03-28 12:45:32,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 279.12/235.71 [2019-03-28 12:45:32,237 INFO L706 BuchiCegarLoop]: Abstraction has 222 states and 337 transitions. 279.12/235.71 [2019-03-28 12:45:32,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 337 transitions. 279.12/235.71 [2019-03-28 12:45:32,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 44. 279.12/235.71 [2019-03-28 12:45:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. 279.12/235.71 [2019-03-28 12:45:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 144 transitions. 279.12/235.71 [2019-03-28 12:45:32,240 INFO L729 BuchiCegarLoop]: Abstraction has 44 states and 144 transitions. 279.12/235.71 [2019-03-28 12:45:32,241 INFO L609 BuchiCegarLoop]: Abstraction has 44 states and 144 transitions. 279.12/235.71 [2019-03-28 12:45:32,241 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 279.12/235.71 [2019-03-28 12:45:32,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 144 transitions. 279.12/235.71 [2019-03-28 12:45:32,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 279.12/235.71 [2019-03-28 12:45:32,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 279.12/235.71 [2019-03-28 12:45:32,242 INFO L119 BuchiIsEmpty]: Starting construction of run 279.12/235.71 [2019-03-28 12:45:32,242 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 279.12/235.71 [2019-03-28 12:45:32,242 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 279.12/235.71 [2019-03-28 12:45:32,243 INFO L794 eck$LassoCheckResult]: Stem: 4099#ULTIMATE.startENTRY [105] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 4094#L-1 [254] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse3 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1))) (let ((.cse5 (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_1| 1))) (let ((.cse4 (store .cse5 |v_ULTIMATE.start_main_#t~malloc4.base_1| 1))) (let ((.cse2 (store .cse4 |v_ULTIMATE.start_main_#t~malloc5.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~a~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc6.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_1|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_1|) (= 0 (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~c~0.base_1 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~N~0.offset_1 |v_ULTIMATE.start_main_#t~malloc6.offset_1|) (> |v_ULTIMATE.start_main_#t~malloc5.base_1| 0) (< |v_ULTIMATE.start_main_#t~malloc5.base_1| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= |v_#valid_3| (store .cse2 |v_ULTIMATE.start_main_#t~malloc6.base_1| 1)) (= (store (store (store (store (store (store (store |v_#length_8| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4) |v_ULTIMATE.start_main_#t~malloc3.base_1| 4) |v_ULTIMATE.start_main_#t~malloc4.base_1| 4) |v_ULTIMATE.start_main_#t~malloc5.base_1| 4) |v_ULTIMATE.start_main_#t~malloc6.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~b~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 (select .cse3 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (= (select .cse4 |v_ULTIMATE.start_main_#t~malloc5.base_1|) 0) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= (select .cse5 |v_ULTIMATE.start_main_#t~malloc4.base_1|) 0) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~N~0.base_1 |v_ULTIMATE.start_main_#t~malloc6.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> |v_ULTIMATE.start_main_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_main_~b~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_1|) (= v_ULTIMATE.start_main_~c~0.offset_1 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~M~0.base_1 |v_ULTIMATE.start_main_#t~malloc5.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (select .cse2 |v_ULTIMATE.start_main_#t~malloc6.base_1|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= v_ULTIMATE.start_main_~M~0.offset_1 |v_ULTIMATE.start_main_#t~malloc5.offset_1|)))))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_1|, ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_1, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_~N~0.base=v_ULTIMATE.start_main_~N~0.base_1, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_1|, ULTIMATE.start_main_~M~0.offset=v_ULTIMATE.start_main_~M~0.offset_1, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_1|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_1|, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_1, ULTIMATE.start_main_~M~0.base=v_ULTIMATE.start_main_~M~0.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_1|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_1, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_1, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~N~0.offset=v_ULTIMATE.start_main_~N~0.offset_1, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_~c~0.base, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_~N~0.base, ULTIMATE.start_main_~c~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~M~0.offset, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_#t~short13, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~b~0.offset, ULTIMATE.start_main_~M~0.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_~b~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~N~0.offset, ULTIMATE.start_main_~j~0.base, ULTIMATE.start_main_#t~malloc5.offset] 4095#L11 [106] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~i~0.base_4)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~i~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 4097#L11-1 [364] L11-1-->L12: Formula: (and (= 1 (select |v_#valid_49| v_ULTIMATE.start_main_~a~0.base_7)) (<= 0 v_ULTIMATE.start_main_~a~0.offset_6) (<= (+ v_ULTIMATE.start_main_~a~0.offset_6 4) (select |v_#length_39| v_ULTIMATE.start_main_~a~0.base_7)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~a~0.base_7 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~a~0.base_7) v_ULTIMATE.start_main_~a~0.offset_6 |v_ULTIMATE.start_main_#t~mem7_6|)))) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_6, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_23|, #length=|v_#length_39|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_7} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_6, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_39|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 4098#L12 [125] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_13| v_ULTIMATE.start_main_~j~0.base_4)) (= (select |v_#valid_15| v_ULTIMATE.start_main_~j~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 4101#L12-1 [365] L12-1-->L13: Formula: (and (<= (+ v_ULTIMATE.start_main_~b~0.offset_6 4) (select |v_#length_40| v_ULTIMATE.start_main_~b~0.base_7)) (<= 0 v_ULTIMATE.start_main_~b~0.offset_6) (= 1 (select |v_#valid_50| v_ULTIMATE.start_main_~b~0.base_7)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~b~0.base_7 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~b~0.base_7) v_ULTIMATE.start_main_~b~0.offset_6 |v_ULTIMATE.start_main_#t~mem8_6|)) |v_#memory_int_24|)) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_7, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_6, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_25|, #length=|v_#length_40|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_7, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_6, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_24|, #length=|v_#length_40|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 4102#L13 [136] L13-->L15-9: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~c~0.base_4 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~c~0.base_4) v_ULTIMATE.start_main_~c~0.offset_4 0))) (<= (+ v_ULTIMATE.start_main_~c~0.offset_4 4) (select |v_#length_17| v_ULTIMATE.start_main_~c~0.base_4)) (<= 0 v_ULTIMATE.start_main_~c~0.offset_4) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~c~0.base_4))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_7|, #length=|v_#length_17|, #valid=|v_#valid_19|} AuxVars[] AssignedVars[#memory_int] 4105#L15-9 [80] L15-9-->L15: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_7)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6) |v_ULTIMATE.start_main_#t~mem9_2|) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 4114#L15 [96] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~M~0.offset_4 4) (select |v_#length_21| v_ULTIMATE.start_main_~M~0.base_4)) (= (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~M~0.base_4) v_ULTIMATE.start_main_~M~0.offset_4) |v_ULTIMATE.start_main_#t~mem10_2|) (= (select |v_#valid_23| v_ULTIMATE.start_main_~M~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~M~0.offset_4)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_21|, ULTIMATE.start_main_~M~0.base=v_ULTIMATE.start_main_~M~0.base_4, ULTIMATE.start_main_~M~0.offset=v_ULTIMATE.start_main_~M~0.offset_4, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~M~0.base=v_ULTIMATE.start_main_~M~0.base_4, ULTIMATE.start_main_~M~0.offset=v_ULTIMATE.start_main_~M~0.offset_4, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 4077#L15-1 279.12/235.71 [2019-03-28 12:45:32,244 INFO L796 eck$LassoCheckResult]: Loop: 4077#L15-1 [329] L15-1-->L15-2: Formula: (and |v_ULTIMATE.start_main_#t~short13_2| (< |v_ULTIMATE.start_main_#t~mem9_3| |v_ULTIMATE.start_main_#t~mem10_3|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_3|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_3|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short13] 4103#L15-2 [112] L15-2-->L15-7: Formula: |v_ULTIMATE.start_main_#t~short13_3| InVars {ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_3|} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_3|} AuxVars[] AssignedVars[] 4090#L15-7 [90] L15-7-->L16: Formula: |v_ULTIMATE.start_main_#t~short13_9| InVars {ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_9|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_8|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~short13] 4084#L16 [118] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem14_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_27| v_ULTIMATE.start_main_~i~0.base_10)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_27|, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_27|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 4072#L16-1 [369] L16-1-->L17: Formula: (and (= 1 (select |v_#valid_57| v_ULTIMATE.start_main_~i~0.base_16)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem14_6| 1))) |v_#memory_int_26|) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_41| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_27|, #length=|v_#length_41|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_26|, #length=|v_#length_41|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem14] 4073#L17 [133] L17-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_31| v_ULTIMATE.start_main_~j~0.base_10)) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8) (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_31|, #valid=|v_#valid_33|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_31|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 4080#L17-1 [370] L17-1-->L18: Formula: (and (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_28|) (= 1 (select |v_#valid_58| v_ULTIMATE.start_main_~j~0.base_16)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_42| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_42|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_42|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 4081#L18 [86] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~c~0.offset_6) (<= (+ v_ULTIMATE.start_main_~c~0.offset_6 4) (select |v_#length_35| v_ULTIMATE.start_main_~c~0.base_7)) (= (select |v_#valid_37| v_ULTIMATE.start_main_~c~0.base_7) 1) (= |v_ULTIMATE.start_main_#t~mem16_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_main_~c~0.base_7) v_ULTIMATE.start_main_~c~0.offset_6))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_7, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_6, #memory_int=|v_#memory_int_19|, #length=|v_#length_35|, #valid=|v_#valid_37|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_7, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_6, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, #length=|v_#length_35|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem16] 4088#L18-1 [371] L18-1-->L15-9: Formula: (and (<= (+ v_ULTIMATE.start_main_~c~0.offset_10 4) (select |v_#length_43| v_ULTIMATE.start_main_~c~0.base_13)) (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~c~0.base_13 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~c~0.base_13) v_ULTIMATE.start_main_~c~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem16_6| 1))) |v_#memory_int_30|) (= 1 (select |v_#valid_59| v_ULTIMATE.start_main_~c~0.base_13)) (<= 0 v_ULTIMATE.start_main_~c~0.offset_10)) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_13, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_10, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_31|, #length=|v_#length_43|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_6|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_13, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_10, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_30|, #length=|v_#length_43|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem16] 4086#L15-9 [80] L15-9-->L15: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_7)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6) |v_ULTIMATE.start_main_#t~mem9_2|) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 4076#L15 [96] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~M~0.offset_4 4) (select |v_#length_21| v_ULTIMATE.start_main_~M~0.base_4)) (= (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~M~0.base_4) v_ULTIMATE.start_main_~M~0.offset_4) |v_ULTIMATE.start_main_#t~mem10_2|) (= (select |v_#valid_23| v_ULTIMATE.start_main_~M~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~M~0.offset_4)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_21|, ULTIMATE.start_main_~M~0.base=v_ULTIMATE.start_main_~M~0.base_4, ULTIMATE.start_main_~M~0.offset=v_ULTIMATE.start_main_~M~0.offset_4, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~M~0.base=v_ULTIMATE.start_main_~M~0.base_4, ULTIMATE.start_main_~M~0.offset=v_ULTIMATE.start_main_~M~0.offset_4, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 4077#L15-1 279.12/235.71 [2019-03-28 12:45:32,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:45:32,244 INFO L82 PathProgramCache]: Analyzing trace with hash 835155664, now seen corresponding path program 1 times 279.12/235.71 [2019-03-28 12:45:32,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.71 [2019-03-28 12:45:32,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.71 [2019-03-28 12:45:32,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:45:32,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:45:32,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:45:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:45:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:45:32,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:45:32,274 INFO L82 PathProgramCache]: Analyzing trace with hash 2062618759, now seen corresponding path program 2 times 279.12/235.71 [2019-03-28 12:45:32,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.71 [2019-03-28 12:45:32,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.71 [2019-03-28 12:45:32,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:45:32,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:45:32,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:45:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:45:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:45:32,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.71 [2019-03-28 12:45:32,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1370002008, now seen corresponding path program 1 times 279.12/235.71 [2019-03-28 12:45:32,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 279.12/235.71 [2019-03-28 12:45:32,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 279.12/235.71 [2019-03-28 12:45:32,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:45:32,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:45:32,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 279.12/235.71 [2019-03-28 12:45:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:45:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.71 [2019-03-28 12:45:32,433 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 78 279.12/235.71 [2019-03-28 12:45:33,833 WARN L188 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 177 DAG size of output: 152 279.12/235.71 [2019-03-28 12:45:34,528 WARN L188 SmtUtils]: Spent 692.00 ms on a formula simplification that was a NOOP. DAG size: 142 279.12/235.71 [2019-03-28 12:45:34,533 INFO L216 LassoAnalysis]: Preferences: 279.12/235.71 [2019-03-28 12:45:34,533 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 279.12/235.71 [2019-03-28 12:45:34,533 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 279.12/235.71 [2019-03-28 12:45:34,533 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 279.12/235.71 [2019-03-28 12:45:34,533 INFO L127 ssoRankerPreferences]: Use exernal solver: false 279.12/235.71 [2019-03-28 12:45:34,533 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 279.12/235.71 [2019-03-28 12:45:34,533 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 279.12/235.71 [2019-03-28 12:45:34,533 INFO L130 ssoRankerPreferences]: Path of dumped script: 279.12/235.71 [2019-03-28 12:45:34,534 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 279.12/235.71 [2019-03-28 12:45:34,534 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 279.12/235.71 [2019-03-28 12:45:34,534 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 279.12/235.71 [2019-03-28 12:45:34,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:45:34,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:45:34,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:45:34,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:45:34,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:45:34,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:45:34,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:45:34,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:45:34,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:45:34,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:45:35,720 WARN L188 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 119 279.12/235.71 [2019-03-28 12:45:35,981 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 279.12/235.71 [2019-03-28 12:45:35,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:45:35,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:45:35,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:45:35,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 279.12/235.71 [2019-03-28 12:45:36,338 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 279.12/235.71 [2019-03-28 12:45:36,806 INFO L300 LassoAnalysis]: Preprocessing complete. 279.12/235.71 [2019-03-28 12:45:36,806 INFO L497 LassoAnalysis]: Using template 'affine'. 279.12/235.71 [2019-03-28 12:45:36,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:45:36,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:45:36,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:45:36,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:45:36,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:45:36,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:45:36,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,871 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,871 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.71 Simplify termination arguments: true 279.12/235.71 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.71 [2019-03-28 12:45:36,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.71 [2019-03-28 12:45:36,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.71 [2019-03-28 12:45:36,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.71 [2019-03-28 12:45:36,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.71 [2019-03-28 12:45:36,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.71 [2019-03-28 12:45:36,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.71 [2019-03-28 12:45:36,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.71 [2019-03-28 12:45:36,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.71 [2019-03-28 12:45:36,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.71 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.71 Number of strict supporting invariants: 0 279.12/235.71 Number of non-strict supporting invariants: 1 279.12/235.71 Consider only non-deceasing supporting invariants: true 279.12/235.72 Simplify termination arguments: true 279.12/235.72 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.72 [2019-03-28 12:45:36,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.72 [2019-03-28 12:45:36,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 279.12/235.72 [2019-03-28 12:45:36,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.72 [2019-03-28 12:45:36,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.72 [2019-03-28 12:45:36,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.72 [2019-03-28 12:45:36,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 279.12/235.72 [2019-03-28 12:45:36,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 279.12/235.72 [2019-03-28 12:45:36,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.72 [2019-03-28 12:45:36,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.72 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.72 Number of strict supporting invariants: 0 279.12/235.72 Number of non-strict supporting invariants: 1 279.12/235.72 Consider only non-deceasing supporting invariants: true 279.12/235.72 Simplify termination arguments: true 279.12/235.72 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.72 [2019-03-28 12:45:36,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.72 [2019-03-28 12:45:36,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.72 [2019-03-28 12:45:36,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.72 [2019-03-28 12:45:36,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.72 [2019-03-28 12:45:36,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.72 [2019-03-28 12:45:36,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.72 [2019-03-28 12:45:36,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 279.12/235.72 [2019-03-28 12:45:36,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 279.12/235.72 Termination analysis: LINEAR_WITH_GUESSES 279.12/235.72 Number of strict supporting invariants: 0 279.12/235.72 Number of non-strict supporting invariants: 1 279.12/235.72 Consider only non-deceasing supporting invariants: true 279.12/235.72 Simplify termination arguments: true 279.12/235.72 Simplify supporting invariants: trueOverapproximate stem: false 279.12/235.72 [2019-03-28 12:45:36,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. 279.12/235.72 [2019-03-28 12:45:36,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 279.12/235.72 [2019-03-28 12:45:36,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 279.12/235.72 [2019-03-28 12:45:36,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 279.12/235.72 [2019-03-28 12:45:36,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 279.12/235.72 [2019-03-28 12:45:36,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 279.12/235.72 [2019-03-28 12:45:36,935 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 279.12/235.72 [2019-03-28 12:45:36,942 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 279.12/235.72 [2019-03-28 12:45:36,943 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. 279.12/235.72 [2019-03-28 12:45:36,944 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 279.12/235.72 [2019-03-28 12:45:36,945 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 279.12/235.72 [2019-03-28 12:45:36,945 INFO L518 LassoAnalysis]: Proved termination. 279.12/235.72 [2019-03-28 12:45:36,945 INFO L520 LassoAnalysis]: Termination argument consisting of: 279.12/235.72 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~M~0.base) ULTIMATE.start_main_~M~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~M~0.base) ULTIMATE.start_main_~M~0.offset)_3 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_3 279.12/235.72 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_3 + 1*ULTIMATE.start_main_#t~mem9 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~M~0.base) ULTIMATE.start_main_~M~0.offset)_3 - 1*ULTIMATE.start_main_#t~mem10 >= 0] 279.12/235.72 [2019-03-28 12:45:37,525 INFO L297 tatePredicateManager]: 95 out of 98 supporting invariants were superfluous and have been removed 279.12/235.72 [2019-03-28 12:45:37,533 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 279.12/235.72 [2019-03-28 12:45:37,538 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 279.12/235.72 [2019-03-28 12:45:37,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 279.12/235.72 [2019-03-28 12:45:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.72 [2019-03-28 12:45:37,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core 279.12/235.72 [2019-03-28 12:45:37,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.12/235.72 [2019-03-28 12:45:37,604 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.72 [2019-03-28 12:45:37,604 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 90 279.12/235.72 [2019-03-28 12:45:37,605 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.72 [2019-03-28 12:45:37,627 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.72 [2019-03-28 12:45:37,627 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 279.12/235.72 [2019-03-28 12:45:37,628 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:10 279.12/235.72 [2019-03-28 12:45:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 279.12/235.72 [2019-03-28 12:45:37,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 14 conjunts are in the unsatisfiable core 279.12/235.72 [2019-03-28 12:45:37,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... 279.12/235.72 [2019-03-28 12:45:37,729 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.72 [2019-03-28 12:45:37,729 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 279.12/235.72 [2019-03-28 12:45:37,733 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.72 [2019-03-28 12:45:37,771 INFO L497 ElimStorePlain]: treesize reduction 37, result has 51.3 percent of original size 279.12/235.72 [2019-03-28 12:45:37,771 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 279.12/235.72 [2019-03-28 12:45:37,772 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 279.12/235.72 [2019-03-28 12:45:37,872 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.72 [2019-03-28 12:45:37,872 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 87 279.12/235.72 [2019-03-28 12:45:37,875 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.72 [2019-03-28 12:45:37,914 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.72 [2019-03-28 12:45:37,914 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 87 279.12/235.72 [2019-03-28 12:45:37,917 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 279.12/235.72 [2019-03-28 12:45:38,043 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 279.12/235.72 [2019-03-28 12:45:38,044 INFO L497 ElimStorePlain]: treesize reduction 103, result has 53.4 percent of original size 279.12/235.72 [2019-03-28 12:45:38,045 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 279.12/235.72 [2019-03-28 12:45:38,045 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:100 279.12/235.72 [2019-03-28 12:45:45,988 WARN L188 SmtUtils]: Spent 4.99 s on a formula simplification that was a NOOP. DAG size: 48 279.12/235.72 [2019-03-28 12:45:48,776 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.72 [2019-03-28 12:45:48,777 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 87 279.12/235.72 [2019-03-28 12:45:48,780 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 279.12/235.72 [2019-03-28 12:45:48,815 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 279.12/235.72 [2019-03-28 12:45:48,816 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 87 279.12/235.72 [2019-03-28 12:45:48,819 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 279.12/235.72 [2019-03-28 12:45:48,934 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 279.12/235.72 [2019-03-28 12:45:48,934 INFO L497 ElimStorePlain]: treesize reduction 89, result has 57.0 percent of original size 279.12/235.72 [2019-03-28 12:45:48,936 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 279.12/235.72 [2019-03-28 12:45:48,936 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:100 279.12/235.72 [2019-03-28 12:46:10,230 WARN L188 SmtUtils]: Spent 10.01 s on a formula simplification. DAG size of input: 48 DAG size of output: 35 279.12/235.72 [2019-03-28 12:46:13,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 279.12/235.72 [2019-03-28 12:46:15,037 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_ULTIMATE.start_main_~M~0.base) c_ULTIMATE.start_main_~M~0.offset))) (or (exists ((ULTIMATE.start_main_~j~0.offset Int)) (not (and (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~j~0.base) (= ULTIMATE.start_main_~j~0.offset c_ULTIMATE.start_main_~i~0.offset)))) (<= (+ .cse0 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset) c_oldRank0)) (<= (+ .cse0 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~j~0.base) c_ULTIMATE.start_main_~i~0.offset) c_oldRank0)))) is different from true 279.12/235.72 [2019-03-28 12:46:15,971 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_ULTIMATE.start_main_~M~0.base) c_ULTIMATE.start_main_~M~0.offset))) (or (exists ((v_prenex_3 Int)) (not (and (= v_prenex_3 c_ULTIMATE.start_main_~i~0.offset) (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~j~0.base)))) (<= (+ .cse0 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset) c_oldRank0)) (<= (+ .cse0 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~j~0.base) c_ULTIMATE.start_main_~i~0.offset) c_oldRank0)))) is different from true 279.12/235.72 [2019-03-28 12:46:17,215 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~j~0.offset Int)) (not (and (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~j~0.base) (= ULTIMATE.start_main_~j~0.offset c_ULTIMATE.start_main_~i~0.offset)))) (exists ((v_prenex_3 Int)) (not (and (= v_prenex_3 c_ULTIMATE.start_main_~i~0.offset) (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~j~0.base)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~M~0.base) c_ULTIMATE.start_main_~M~0.offset) 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~j~0.base) c_ULTIMATE.start_main_~i~0.offset) c_oldRank0))) is different from true 279.12/235.72 [2019-03-28 12:46:18,135 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~j~0.offset Int)) (not (and (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~j~0.base) (= ULTIMATE.start_main_~j~0.offset c_ULTIMATE.start_main_~i~0.offset)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~M~0.base) c_ULTIMATE.start_main_~M~0.offset) 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~j~0.base) c_ULTIMATE.start_main_~i~0.offset) c_oldRank0)) (not (= c_ULTIMATE.start_main_~M~0.offset c_ULTIMATE.start_main_~i~0.offset))) is different from true 279.12/235.72 [2019-03-28 12:46:19,044 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_3 Int)) (not (and (= v_prenex_3 c_ULTIMATE.start_main_~i~0.offset) (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~j~0.base)))) (not (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~M~0.base))) is different from true 279.12/235.72 [2019-03-28 12:46:19,940 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~c~0.offset Int)) (not (and (= ULTIMATE.start_main_~c~0.offset c_ULTIMATE.start_main_~i~0.offset) (= c_ULTIMATE.start_main_~i~0.base c_ULTIMATE.start_main_~c~0.base)))) (not (= c_ULTIMATE.start_main_~M~0.offset c_ULTIMATE.start_main_~i~0.offset))) is different from true 279.12/235.72 [2019-03-28 12:46:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.72 [2019-03-28 12:46:19,982 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.12/235.72 [2019-03-28 12:46:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.72 [2019-03-28 12:46:19,993 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.12/235.72 [2019-03-28 12:46:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.72 [2019-03-28 12:46:20,005 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.12/235.72 [2019-03-28 12:46:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.72 [2019-03-28 12:46:20,016 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.12/235.72 [2019-03-28 12:46:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.72 [2019-03-28 12:46:20,027 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.12/235.72 [2019-03-28 12:46:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.72 [2019-03-28 12:46:20,038 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.12/235.72 [2019-03-28 12:46:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.72 [2019-03-28 12:46:20,050 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.12/235.72 [2019-03-28 12:46:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 279.12/235.72 [2019-03-28 12:46:20,060 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 279.12/235.72 [2019-03-28 12:46:20,060 INFO L98 LoopCannibalizer]: 24 predicates before loop cannibalization 24 predicates after loop cannibalization 279.12/235.72 [2019-03-28 12:46:20,060 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 24 loop predicates 279.12/235.72 [2019-03-28 12:46:20,061 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 44 states and 144 transitions. cyclomatic complexity: 102 Second operand 12 states. 279.12/235.72 [2019-03-28 12:46:24,352 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 44 states and 144 transitions. cyclomatic complexity: 102. Second operand 12 states. Result 214 states and 332 transitions. Complement of second has 77 states. 279.12/235.72 [2019-03-28 12:46:24,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 27 states 3 stem states 21 non-accepting loop states 3 accepting loop states 279.12/235.72 [2019-03-28 12:46:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 279.12/235.72 [2019-03-28 12:46:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 176 transitions. 279.12/235.72 [2019-03-28 12:46:24,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 176 transitions. Stem has 9 letters. Loop has 11 letters. 279.12/235.72 [2019-03-28 12:46:24,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. 279.12/235.72 [2019-03-28 12:46:24,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 176 transitions. Stem has 20 letters. Loop has 11 letters. 279.12/235.72 [2019-03-28 12:46:24,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. 279.12/235.72 [2019-03-28 12:46:24,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 176 transitions. Stem has 9 letters. Loop has 22 letters. 279.12/235.72 [2019-03-28 12:46:24,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. 279.12/235.72 [2019-03-28 12:46:24,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 332 transitions. 279.12/235.72 [2019-03-28 12:46:24,397 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 279.12/235.72 [2019-03-28 12:46:24,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 0 states and 0 transitions. 279.12/235.72 [2019-03-28 12:46:24,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 279.12/235.72 [2019-03-28 12:46:24,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 279.12/235.72 [2019-03-28 12:46:24,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 279.12/235.72 [2019-03-28 12:46:24,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 279.12/235.72 [2019-03-28 12:46:24,398 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 279.12/235.72 [2019-03-28 12:46:24,398 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 279.12/235.72 [2019-03-28 12:46:24,398 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 279.12/235.72 [2019-03-28 12:46:24,398 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 279.12/235.72 [2019-03-28 12:46:24,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 279.12/235.72 [2019-03-28 12:46:24,398 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 279.12/235.72 [2019-03-28 12:46:24,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 279.12/235.72 [2019-03-28 12:46:24,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:24 BasicIcfg 279.12/235.72 [2019-03-28 12:46:24,405 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 279.12/235.72 [2019-03-28 12:46:24,405 INFO L168 Benchmark]: Toolchain (without parser) took 231406.82 ms. Allocated memory was 649.6 MB in the beginning and 811.1 MB in the end (delta: 161.5 MB). Free memory was 559.5 MB in the beginning and 587.4 MB in the end (delta: -27.9 MB). Peak memory consumption was 133.6 MB. Max. memory is 50.3 GB. 279.12/235.72 [2019-03-28 12:46:24,406 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 279.12/235.72 [2019-03-28 12:46:24,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.79 ms. Allocated memory was 649.6 MB in the beginning and 672.7 MB in the end (delta: 23.1 MB). Free memory was 559.5 MB in the beginning and 640.0 MB in the end (delta: -80.5 MB). Peak memory consumption was 31.8 MB. Max. memory is 50.3 GB. 279.12/235.72 [2019-03-28 12:46:24,406 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.80 ms. Allocated memory is still 672.7 MB. Free memory was 640.0 MB in the beginning and 636.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 279.12/235.72 [2019-03-28 12:46:24,407 INFO L168 Benchmark]: Boogie Preprocessor took 24.95 ms. Allocated memory is still 672.7 MB. Free memory was 636.9 MB in the beginning and 634.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 279.12/235.72 [2019-03-28 12:46:24,407 INFO L168 Benchmark]: RCFGBuilder took 422.18 ms. Allocated memory is still 672.7 MB. Free memory was 634.2 MB in the beginning and 605.4 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. 279.12/235.72 [2019-03-28 12:46:24,408 INFO L168 Benchmark]: BlockEncodingV2 took 241.97 ms. Allocated memory is still 672.7 MB. Free memory was 605.4 MB in the beginning and 569.0 MB in the end (delta: 36.4 MB). Peak memory consumption was 36.4 MB. Max. memory is 50.3 GB. 279.12/235.72 [2019-03-28 12:46:24,408 INFO L168 Benchmark]: TraceAbstraction took 12090.01 ms. Allocated memory was 672.7 MB in the beginning and 844.6 MB in the end (delta: 172.0 MB). Free memory was 567.7 MB in the beginning and 574.2 MB in the end (delta: -6.5 MB). Peak memory consumption was 165.5 MB. Max. memory is 50.3 GB. 279.12/235.72 [2019-03-28 12:46:24,409 INFO L168 Benchmark]: BuchiAutomizer took 218268.45 ms. Allocated memory was 844.6 MB in the beginning and 811.1 MB in the end (delta: -33.6 MB). Free memory was 574.2 MB in the beginning and 587.4 MB in the end (delta: -13.2 MB). There was no memory consumed. Max. memory is 50.3 GB. 279.12/235.72 [2019-03-28 12:46:24,411 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 279.12/235.72 --- Results --- 279.12/235.72 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 279.12/235.72 - StatisticsResult: Initial Icfg 279.12/235.72 60 locations, 62 edges 279.12/235.72 - StatisticsResult: Encoded RCFG 279.12/235.72 51 locations, 211 edges 279.12/235.72 * Results from de.uni_freiburg.informatik.ultimate.core: 279.12/235.72 - StatisticsResult: Toolchain Benchmarks 279.12/235.72 Benchmark results are: 279.12/235.72 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 279.12/235.72 * CACSL2BoogieTranslator took 310.79 ms. Allocated memory was 649.6 MB in the beginning and 672.7 MB in the end (delta: 23.1 MB). Free memory was 559.5 MB in the beginning and 640.0 MB in the end (delta: -80.5 MB). Peak memory consumption was 31.8 MB. Max. memory is 50.3 GB. 279.12/235.72 * Boogie Procedure Inliner took 41.80 ms. Allocated memory is still 672.7 MB. Free memory was 640.0 MB in the beginning and 636.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 279.12/235.72 * Boogie Preprocessor took 24.95 ms. Allocated memory is still 672.7 MB. Free memory was 636.9 MB in the beginning and 634.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 279.12/235.72 * RCFGBuilder took 422.18 ms. Allocated memory is still 672.7 MB. Free memory was 634.2 MB in the beginning and 605.4 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. 279.12/235.72 * BlockEncodingV2 took 241.97 ms. Allocated memory is still 672.7 MB. Free memory was 605.4 MB in the beginning and 569.0 MB in the end (delta: 36.4 MB). Peak memory consumption was 36.4 MB. Max. memory is 50.3 GB. 279.12/235.72 * TraceAbstraction took 12090.01 ms. Allocated memory was 672.7 MB in the beginning and 844.6 MB in the end (delta: 172.0 MB). Free memory was 567.7 MB in the beginning and 574.2 MB in the end (delta: -6.5 MB). Peak memory consumption was 165.5 MB. Max. memory is 50.3 GB. 279.12/235.72 * BuchiAutomizer took 218268.45 ms. Allocated memory was 844.6 MB in the beginning and 811.1 MB in the end (delta: -33.6 MB). Free memory was 574.2 MB in the beginning and 587.4 MB in the end (delta: -13.2 MB). There was no memory consumed. Max. memory is 50.3 GB. 279.12/235.72 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 279.12/235.72 - GenericResult: Unfinished Backtranslation 279.12/235.72 unknown boogie variable #length 279.12/235.72 - GenericResult: Unfinished Backtranslation 279.12/235.72 unknown boogie variable #length 279.12/235.72 - GenericResult: Unfinished Backtranslation 279.12/235.72 unknown boogie variable #length 279.12/235.72 - GenericResult: Unfinished Backtranslation 279.12/235.72 unknown boogie variable #length 279.12/235.72 - GenericResult: Unfinished Backtranslation 279.12/235.72 unknown boogie variable #length 279.12/235.72 - GenericResult: Unfinished Backtranslation 279.12/235.72 unknown boogie variable #length 279.12/235.72 - GenericResult: Unfinished Backtranslation 279.12/235.72 unknown boogie variable #length 279.12/235.72 - GenericResult: Unfinished Backtranslation 279.12/235.72 unknown boogie variable #length 279.12/235.72 - GenericResult: Unfinished Backtranslation 279.12/235.72 unknown boogie variable #length 279.12/235.72 - GenericResult: Unfinished Backtranslation 279.12/235.72 unknown boogie variable #length 279.12/235.72 - GenericResult: Unfinished Backtranslation 279.12/235.72 unknown boogie variable #length 279.12/235.72 - GenericResult: Unfinished Backtranslation 279.12/235.72 unknown boogie variable #length 279.12/235.72 - GenericResult: Unfinished Backtranslation 279.12/235.72 unknown boogie variable #length 279.12/235.72 - GenericResult: Unfinished Backtranslation 279.12/235.72 unknown boogie variable #length 279.12/235.72 - GenericResult: Unfinished Backtranslation 279.12/235.72 unknown boogie variable #memory_int 279.12/235.72 - GenericResult: Unfinished Backtranslation 279.12/235.72 unknown boogie variable #memory_int 279.12/235.72 - GenericResult: Unfinished Backtranslation 279.12/235.72 unknown boogie variable #memory_int 279.12/235.72 - GenericResult: Unfinished Backtranslation 279.12/235.72 unknown boogie variable #memory_int 279.12/235.72 - GenericResult: Unfinished Backtranslation 279.12/235.72 unknown boogie variable #memory_int 279.12/235.72 - GenericResult: Unfinished Backtranslation 279.12/235.72 unknown boogie variable #memory_int 279.12/235.72 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 279.12/235.72 - PositiveResult [Line: 15]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 15]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 15]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 15]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 15]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 15]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 15]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 15]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 13]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 13]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 18]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 12]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 18]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 12]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 18]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 12]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 18]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 12]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 17]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 11]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 17]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 11]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 17]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 11]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 17]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 11]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 16]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 16]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 16]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - PositiveResult [Line: 16]: pointer dereference always succeeds 279.12/235.72 For all program executions holds that pointer dereference always succeeds at this location 279.12/235.72 - AllSpecificationsHoldResult: All specifications hold 279.12/235.72 30 specifications checked. All of them hold 279.12/235.72 - InvariantResult [Line: 13]: Loop Invariant 279.12/235.72 [2019-03-28 12:46:24,420 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.72 [2019-03-28 12:46:24,420 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.72 [2019-03-28 12:46:24,420 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.72 [2019-03-28 12:46:24,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.72 [2019-03-28 12:46:24,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.72 [2019-03-28 12:46:24,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.72 [2019-03-28 12:46:24,421 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.72 [2019-03-28 12:46:24,423 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.72 [2019-03-28 12:46:24,423 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.72 [2019-03-28 12:46:24,423 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.72 [2019-03-28 12:46:24,424 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.72 [2019-03-28 12:46:24,424 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.72 [2019-03-28 12:46:24,424 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.72 [2019-03-28 12:46:24,424 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 279.12/235.72 Derived loop invariant: (((((((((((((((((((1 == \valid[M] && 0 == j) && unknown-#length-unknown[a] == 4) && a == 0) && unknown-#length-unknown[c] == 4) && 4 == unknown-#length-unknown[i]) && b == 0) && 4 == unknown-#length-unknown[b]) && 1 == \valid[c]) && N == 0) && unknown-#length-unknown[M] == 4) && \valid[b] == 1) && 1 == \valid[N]) && unknown-#length-unknown[N] == 4) && M == 0) && c == 0) && 1 == \valid[j]) && 0 == i) && 1 == \valid[a]) && 1 == \valid[i]) && unknown-#length-unknown[j] == 4 279.12/235.72 - StatisticsResult: Ultimate Automizer benchmark data 279.12/235.72 CFG has 1 procedures, 51 locations, 30 error locations. SAFE Result, 12.0s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 10.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 110 SDtfs, 789 SDslu, 10 SDs, 0 SdLazy, 2837 SolverSat, 2458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 92 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 4258 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 279.12/235.72 - StatisticsResult: Constructed decomposition of program 279.12/235.72 Your program was decomposed into 4 terminating modules (1 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[M][M] + -1 * unknown-#memory_int-unknown[i][i] and consists of 58 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[j][j] + unknown-#memory_int-unknown[N][N] and consists of 34 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[M][M] + -1 * unknown-#memory_int-unknown[i][i] and consists of 27 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. 279.12/235.72 - StatisticsResult: Timing statistics 279.12/235.72 BüchiAutomizer plugin needed 218.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 15.1s. Construction of modules took 3.7s. Büchi inclusion checks took 199.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 410 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 69 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 110 SDtfs, 1200 SDslu, 586 SDs, 0 SdLazy, 2638 SolverSat, 1082 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital676 mio100 ax100 hnf100 lsp97 ukn46 mio100 lsp37 div100 bol100 ite100 ukn100 eq195 hnf87 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 279.12/235.72 - TerminationAnalysisResult: Termination proven 279.12/235.72 Buchi Automizer proved that your program is terminating 279.12/235.72 RESULT: Ultimate proved your program to be correct! 279.12/235.72 !SESSION 2019-03-28 12:42:29.782 ----------------------------------------------- 279.12/235.72 eclipse.buildId=unknown 279.12/235.72 java.version=1.8.0_181 279.12/235.72 java.vendor=Oracle Corporation 279.12/235.72 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 279.12/235.72 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 279.12/235.72 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 279.12/235.72 279.12/235.72 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:46:24.649 279.12/235.72 !MESSAGE The workspace will exit with unsaved changes in this session. 279.12/235.72 Received shutdown request... 279.12/235.72 Ultimate: 279.12/235.72 GTK+ Version Check 279.12/235.72 EOF