./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_35324010-5134-4912-838a-896f725846ce/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_35324010-5134-4912-838a-896f725846ce/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_35324010-5134-4912-838a-896f725846ce/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_35324010-5134-4912-838a-896f725846ce/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_35324010-5134-4912-838a-896f725846ce/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_35324010-5134-4912-838a-896f725846ce/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0233d496bfaf5cb1311bfa260a57f41458184795 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:07:32,526 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:07:32,528 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:07:32,542 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:07:32,543 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:07:32,544 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:07:32,547 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:07:32,549 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:07:32,551 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:07:32,553 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:07:32,556 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:07:32,556 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:07:32,557 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:07:32,559 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:07:32,567 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:07:32,567 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:07:32,568 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:07:32,570 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:07:32,571 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:07:32,572 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:07:32,573 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:07:32,575 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:07:32,576 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:07:32,577 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:07:32,577 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:07:32,578 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:07:32,579 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:07:32,580 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:07:32,580 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:07:32,582 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:07:32,582 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:07:32,582 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:07:32,583 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:07:32,583 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:07:32,584 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:07:32,584 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:07:32,584 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_35324010-5134-4912-838a-896f725846ce/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:07:32,599 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:07:32,599 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:07:32,600 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:07:32,600 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:07:32,600 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:07:32,601 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:07:32,601 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:07:32,601 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:07:32,602 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:07:32,602 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:07:32,602 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:07:32,602 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:07:32,602 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:07:32,603 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:07:32,603 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:07:32,603 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:07:32,603 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:07:32,603 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:07:32,603 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:07:32,603 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:07:32,604 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:07:32,604 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:07:32,604 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:07:32,604 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:07:32,604 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:07:32,604 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:07:32,605 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:07:32,608 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:07:32,608 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_35324010-5134-4912-838a-896f725846ce/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0233d496bfaf5cb1311bfa260a57f41458184795 [2018-10-27 06:07:32,650 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:07:32,670 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:07:32,674 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:07:32,676 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:07:32,676 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:07:32,678 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_35324010-5134-4912-838a-896f725846ce/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2018-10-27 06:07:32,738 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35324010-5134-4912-838a-896f725846ce/bin-2019/uautomizer/data/6c3d01470/56c1531d89794198a1960384c06b378a/FLAG4b05229dd [2018-10-27 06:07:33,112 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:07:33,114 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_35324010-5134-4912-838a-896f725846ce/sv-benchmarks/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2018-10-27 06:07:33,120 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35324010-5134-4912-838a-896f725846ce/bin-2019/uautomizer/data/6c3d01470/56c1531d89794198a1960384c06b378a/FLAG4b05229dd [2018-10-27 06:07:33,141 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_35324010-5134-4912-838a-896f725846ce/bin-2019/uautomizer/data/6c3d01470/56c1531d89794198a1960384c06b378a [2018-10-27 06:07:33,144 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:07:33,147 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:07:33,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:33,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:07:33,153 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:07:33,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:33" (1/1) ... [2018-10-27 06:07:33,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f25e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:33, skipping insertion in model container [2018-10-27 06:07:33,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:33" (1/1) ... [2018-10-27 06:07:33,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:07:33,194 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:07:33,370 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:33,384 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:07:33,405 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:33,418 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:07:33,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:33 WrapperNode [2018-10-27 06:07:33,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:33,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:33,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:07:33,420 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:07:33,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:33" (1/1) ... [2018-10-27 06:07:33,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:33" (1/1) ... [2018-10-27 06:07:33,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:33,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:07:33,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:07:33,462 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:07:33,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:33" (1/1) ... [2018-10-27 06:07:33,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:33" (1/1) ... [2018-10-27 06:07:33,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:33" (1/1) ... [2018-10-27 06:07:33,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:33" (1/1) ... [2018-10-27 06:07:33,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:33" (1/1) ... [2018-10-27 06:07:33,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:33" (1/1) ... [2018-10-27 06:07:33,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:33" (1/1) ... [2018-10-27 06:07:33,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:07:33,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:07:33,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:07:33,487 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:07:33,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35324010-5134-4912-838a-896f725846ce/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:33,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:07:33,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:07:33,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:07:33,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:07:34,089 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:07:34,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:34 BoogieIcfgContainer [2018-10-27 06:07:34,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:07:34,091 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:07:34,091 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:07:34,094 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:07:34,099 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:34,099 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:07:33" (1/3) ... [2018-10-27 06:07:34,100 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ee8823f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:34, skipping insertion in model container [2018-10-27 06:07:34,100 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:34,100 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:33" (2/3) ... [2018-10-27 06:07:34,101 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ee8823f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:34, skipping insertion in model container [2018-10-27 06:07:34,101 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:34,101 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:34" (3/3) ... [2018-10-27 06:07:34,102 INFO L375 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2018-10-27 06:07:34,162 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:07:34,163 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:07:34,163 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:07:34,163 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:07:34,163 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:07:34,163 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:07:34,164 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:07:34,164 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:07:34,164 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:07:34,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-10-27 06:07:34,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:07:34,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:34,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:34,210 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:34,210 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:34,210 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:07:34,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-10-27 06:07:34,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:07:34,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:34,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:34,213 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:34,213 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:34,222 INFO L793 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 23#L11true SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L11 21#L11-1true SUMMARY for call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L11-1 11#L12true SUMMARY for call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L12 26#L13true SUMMARY for call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L13 18#L28true [2018-10-27 06:07:34,222 INFO L795 eck$LassoCheckResult]: Loop: 18#L28true assume true; 16#L15true SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 28#L15-1true assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 5#L16true SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 3#L16-1true assume main_#t~mem5 == 0;havoc main_#t~mem5; 17#L17true SUMMARY for call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L17 18#L28true [2018-10-27 06:07:34,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:34,229 INFO L82 PathProgramCache]: Analyzing trace with hash 889444101, now seen corresponding path program 1 times [2018-10-27 06:07:34,231 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:34,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:34,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:34,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:34,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:34,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:34,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1185401861, now seen corresponding path program 1 times [2018-10-27 06:07:34,407 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:34,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:34,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:34,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:34,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:34,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:34,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1664659447, now seen corresponding path program 1 times [2018-10-27 06:07:34,429 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:34,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:34,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:34,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:34,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:34,607 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-27 06:07:35,793 WARN L179 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 124 DAG size of output: 109 [2018-10-27 06:07:36,210 WARN L179 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-10-27 06:07:36,226 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:36,228 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:36,228 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:36,229 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:36,229 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:36,229 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:36,229 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:36,229 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:36,229 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Lasso [2018-10-27 06:07:36,230 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:36,230 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:36,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:36,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:37,185 WARN L179 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 109 [2018-10-27 06:07:37,497 WARN L179 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2018-10-27 06:07:37,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:37,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:37,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:38,096 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:38,102 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:38,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:38,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:38,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:38,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:38,112 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:38,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:38,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,123 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:38,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:38,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,131 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:38,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:38,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:38,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:38,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:38,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:38,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,147 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:38,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:38,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,158 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,160 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:38,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,164 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:38,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:38,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:38,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,212 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,213 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:38,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,216 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:38,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,248 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,250 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:38,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,252 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:38,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:38,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:38,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,306 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:38,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:38,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,327 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:38,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:38,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,342 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:38,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:38,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,360 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:38,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:38,363 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,378 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:38,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:38,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,407 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:38,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:38,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,441 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,442 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:38,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,444 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:38,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,454 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:38,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:38,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,462 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:38,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:38,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:38,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:38,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,478 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:38,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:38,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:38,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:38,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,494 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:38,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:38,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:38,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:38,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:38,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:38,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:38,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:38,504 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:38,511 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:07:38,511 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:07:38,514 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:38,515 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:07:38,516 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:38,516 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1 + 1 Supporting invariants [] [2018-10-27 06:07:38,733 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2018-10-27 06:07:38,739 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:07:38,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:38,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:38,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:38,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:38,971 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-10-27 06:07:38,972 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 5 states. [2018-10-27 06:07:39,123 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states.. Second operand 5 states. Result 52 states and 59 transitions. Complement of second has 10 states. [2018-10-27 06:07:39,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:39,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:07:39,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-10-27 06:07:39,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 6 letters. [2018-10-27 06:07:39,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:39,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 12 letters. Loop has 6 letters. [2018-10-27 06:07:39,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:39,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 12 letters. [2018-10-27 06:07:39,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:39,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 59 transitions. [2018-10-27 06:07:39,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:07:39,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 34 states and 39 transitions. [2018-10-27 06:07:39,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-10-27 06:07:39,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-10-27 06:07:39,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 39 transitions. [2018-10-27 06:07:39,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:39,143 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-10-27 06:07:39,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 39 transitions. [2018-10-27 06:07:39,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-10-27 06:07:39,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-27 06:07:39,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-10-27 06:07:39,176 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-10-27 06:07:39,176 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-10-27 06:07:39,176 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:07:39,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 38 transitions. [2018-10-27 06:07:39,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:07:39,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:39,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:39,180 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:39,180 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:39,180 INFO L793 eck$LassoCheckResult]: Stem: 315#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 311#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 312#L11 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L11 313#L11-1 SUMMARY for call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L11-1 314#L12 SUMMARY for call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L12 318#L13 SUMMARY for call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L13 319#L28 assume true; 306#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 322#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 321#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 294#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 295#L19 [2018-10-27 06:07:39,180 INFO L795 eck$LassoCheckResult]: Loop: 295#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 307#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 308#L20 assume main_#t~mem6 == 0;havoc main_#t~mem6; 310#L21 SUMMARY for call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L21 299#L28 assume true; 290#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 291#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 300#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 301#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 295#L19 [2018-10-27 06:07:39,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:39,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1608869296, now seen corresponding path program 1 times [2018-10-27 06:07:39,181 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:39,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:39,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:39,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:39,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:39,693 WARN L179 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-27 06:07:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:39,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:39,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 06:07:39,878 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:39,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:39,879 INFO L82 PathProgramCache]: Analyzing trace with hash 766480754, now seen corresponding path program 1 times [2018-10-27 06:07:39,879 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:39,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:39,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:39,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:39,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:40,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:07:40,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:07:40,014 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. cyclomatic complexity: 7 Second operand 10 states. [2018-10-27 06:07:40,262 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2018-10-27 06:07:40,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:40,493 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-10-27 06:07:40,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 06:07:40,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 60 transitions. [2018-10-27 06:07:40,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2018-10-27 06:07:40,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 51 states and 56 transitions. [2018-10-27 06:07:40,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-10-27 06:07:40,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-10-27 06:07:40,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 56 transitions. [2018-10-27 06:07:40,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:40,499 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-10-27 06:07:40,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 56 transitions. [2018-10-27 06:07:40,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2018-10-27 06:07:40,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-27 06:07:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-10-27 06:07:40,504 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-10-27 06:07:40,504 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-10-27 06:07:40,504 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:07:40,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 42 transitions. [2018-10-27 06:07:40,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-10-27 06:07:40,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:40,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:40,506 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:40,506 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:40,506 INFO L793 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 421#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 422#L11 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L11 423#L11-1 SUMMARY for call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L11-1 424#L12 SUMMARY for call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L12 428#L13 SUMMARY for call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L13 429#L28 assume true; 401#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 402#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 411#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 405#L16-1 assume main_#t~mem5 == 0;havoc main_#t~mem5; 406#L17 SUMMARY for call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L17 414#L28 assume true; 415#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 435#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 433#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 431#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 418#L19 [2018-10-27 06:07:40,506 INFO L795 eck$LassoCheckResult]: Loop: 418#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 416#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 417#L20 assume main_#t~mem6 == 0;havoc main_#t~mem6; 420#L21 SUMMARY for call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L21 413#L28 assume true; 399#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 400#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 409#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 410#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 418#L19 [2018-10-27 06:07:40,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:40,507 INFO L82 PathProgramCache]: Analyzing trace with hash -617025748, now seen corresponding path program 1 times [2018-10-27 06:07:40,507 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:40,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:40,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:40,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:40,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:40,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:40,555 INFO L82 PathProgramCache]: Analyzing trace with hash 766480754, now seen corresponding path program 2 times [2018-10-27 06:07:40,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:40,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:40,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:40,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:40,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:40,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:40,575 INFO L82 PathProgramCache]: Analyzing trace with hash 174686887, now seen corresponding path program 1 times [2018-10-27 06:07:40,575 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:40,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:40,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:40,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:40,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:40,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:07:40,758 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35324010-5134-4912-838a-896f725846ce/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:07:40,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:40,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:40,823 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:40,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-10-27 06:07:40,855 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:40,856 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:40,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 06:07:40,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:40,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:40,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:40,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2018-10-27 06:07:40,922 INFO L477 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 11 treesize of output 8 [2018-10-27 06:07:40,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:07:40,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:40,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:41,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:41,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:07:41,329 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:41,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:07:41,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-10-27 06:07:41,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:41,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:41,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:41,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-10-27 06:07:41,368 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:07:41,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:07:41,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:41,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:41,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:07:41,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-10-27 06:07:41,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 20 [2018-10-27 06:07:41,482 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 06:07:41,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:41,490 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:07:41,491 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:41,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:41,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:41,496 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-10-27 06:07:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:41,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:07:41,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-27 06:07:41,646 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-10-27 06:07:41,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 06:07:41,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-10-27 06:07:41,670 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. cyclomatic complexity: 6 Second operand 11 states. [2018-10-27 06:07:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:41,904 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-10-27 06:07:41,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 06:07:41,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 57 transitions. [2018-10-27 06:07:41,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-10-27 06:07:41,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 50 states and 53 transitions. [2018-10-27 06:07:41,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-10-27 06:07:41,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-10-27 06:07:41,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 53 transitions. [2018-10-27 06:07:41,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:41,907 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-10-27 06:07:41,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 53 transitions. [2018-10-27 06:07:41,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 32. [2018-10-27 06:07:41,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-27 06:07:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-10-27 06:07:41,910 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-10-27 06:07:41,910 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-10-27 06:07:41,910 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:07:41,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 35 transitions. [2018-10-27 06:07:41,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-10-27 06:07:41,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:41,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:41,911 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:41,911 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:41,911 INFO L793 eck$LassoCheckResult]: Stem: 606#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 602#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 603#L11 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L11 604#L11-1 SUMMARY for call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L11-1 605#L12 SUMMARY for call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L12 609#L13 SUMMARY for call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L13 593#L28 [2018-10-27 06:07:41,911 INFO L795 eck$LassoCheckResult]: Loop: 593#L28 assume true; 588#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 589#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 594#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 590#L16-1 assume main_#t~mem5 == 0;havoc main_#t~mem5; 591#L17 SUMMARY for call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L17 596#L28 assume true; 619#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 618#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 617#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 612#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 599#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 597#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 598#L20 assume main_#t~mem6 == 0;havoc main_#t~mem6; 601#L21 SUMMARY for call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L21 593#L28 [2018-10-27 06:07:41,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:41,912 INFO L82 PathProgramCache]: Analyzing trace with hash 889444101, now seen corresponding path program 2 times [2018-10-27 06:07:41,912 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:41,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:41,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:41,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:41,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:41,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:41,955 INFO L82 PathProgramCache]: Analyzing trace with hash -580486350, now seen corresponding path program 1 times [2018-10-27 06:07:41,955 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:41,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:41,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:41,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:41,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:41,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:41,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1449051218, now seen corresponding path program 2 times [2018-10-27 06:07:41,980 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:41,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:41,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:41,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:41,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:42,753 WARN L179 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2018-10-27 06:07:43,179 WARN L179 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 109 [2018-10-27 06:07:43,386 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-10-27 06:07:43,389 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:43,389 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:43,389 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:43,389 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:43,389 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:43,390 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:43,390 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:43,390 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:43,390 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Lasso [2018-10-27 06:07:43,390 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:43,390 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:43,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:43,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:43,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:43,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:43,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:44,163 WARN L179 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 117 [2018-10-27 06:07:44,309 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2018-10-27 06:07:44,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:44,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:44,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:44,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:44,444 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2018-10-27 06:07:44,930 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:44,930 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:44,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:44,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:44,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:44,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:44,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:44,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:44,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:44,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:44,937 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:44,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:44,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:44,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:44,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:44,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:44,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:44,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:44,945 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:44,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:44,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:44,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:44,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:44,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:44,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:44,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:44,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:44,948 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:44,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:44,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:44,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:44,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:44,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:44,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:44,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:44,958 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:44,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:44,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:44,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:44,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:44,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:44,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:44,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:44,986 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:44,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:44,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:44,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:44,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:44,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:44,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:44,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:44,998 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:44,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:44,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:44,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:44,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:44,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:45,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:45,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:45,008 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:45,010 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:07:45,010 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:07:45,010 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:45,011 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:07:45,011 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:45,012 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2 + 1 Supporting invariants [] [2018-10-27 06:07:46,077 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-10-27 06:07:46,087 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:07:46,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:46,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:46,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:46,294 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:46,304 INFO L477 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 3 case distinctions, treesize of input 30 treesize of output 46 [2018-10-27 06:07:46,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-10-27 06:07:46,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:46,359 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:46,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 37 [2018-10-27 06:07:46,371 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-27 06:07:46,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:07:46,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:07:46,433 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:30, output treesize:67 [2018-10-27 06:07:46,473 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:46,474 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-10-27 06:07:46,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-10-27 06:07:46,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:46,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:46,510 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:46,511 INFO L477 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 22 treesize of output 23 [2018-10-27 06:07:46,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-10-27 06:07:46,513 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:46,517 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:46,572 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:46,573 INFO L477 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 34 treesize of output 33 [2018-10-27 06:07:46,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-10-27 06:07:46,592 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:46,598 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:46,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-10-27 06:07:46,612 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:91, output treesize:54 [2018-10-27 06:07:46,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:46,712 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-10-27 06:07:46,712 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 35 transitions. cyclomatic complexity: 4 Second operand 9 states. [2018-10-27 06:07:47,137 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 35 transitions. cyclomatic complexity: 4. Second operand 9 states. Result 64 states and 69 transitions. Complement of second has 17 states. [2018-10-27 06:07:47,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:47,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:07:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2018-10-27 06:07:47,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 6 letters. Loop has 15 letters. [2018-10-27 06:07:47,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:47,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 21 letters. Loop has 15 letters. [2018-10-27 06:07:47,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:47,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 6 letters. Loop has 30 letters. [2018-10-27 06:07:47,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:47,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 69 transitions. [2018-10-27 06:07:47,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-10-27 06:07:47,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 62 states and 67 transitions. [2018-10-27 06:07:47,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-10-27 06:07:47,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-10-27 06:07:47,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 67 transitions. [2018-10-27 06:07:47,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:47,143 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-10-27 06:07:47,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 67 transitions. [2018-10-27 06:07:47,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-10-27 06:07:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-27 06:07:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-10-27 06:07:47,149 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-10-27 06:07:47,149 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-10-27 06:07:47,149 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:07:47,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 66 transitions. [2018-10-27 06:07:47,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-10-27 06:07:47,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:47,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:47,151 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:47,151 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:47,151 INFO L793 eck$LassoCheckResult]: Stem: 989#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 983#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 984#L11 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L11 985#L11-1 SUMMARY for call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L11-1 986#L12 SUMMARY for call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L12 992#L13 SUMMARY for call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L13 993#L28 assume true; 1002#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 1011#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 1010#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 1009#L16-1 assume main_#t~mem5 == 0;havoc main_#t~mem5; 1008#L17 SUMMARY for call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L17 1007#L28 assume true; 1006#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 1005#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 1004#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 1003#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 979#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 975#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 976#L20 assume !(main_#t~mem6 == 0);havoc main_#t~mem6; 981#L23 [2018-10-27 06:07:47,151 INFO L795 eck$LassoCheckResult]: Loop: 981#L23 SUMMARY for call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L23 990#L23-1 SUMMARY for call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L23-1 991#L24 assume main_#t~mem7 == 0;havoc main_#t~mem7; 994#L25 SUMMARY for call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L25 995#L28 assume true; 1018#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 1017#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 1015#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 1014#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 1001#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 999#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 997#L20 assume !(main_#t~mem6 == 0);havoc main_#t~mem6; 981#L23 [2018-10-27 06:07:47,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:47,152 INFO L82 PathProgramCache]: Analyzing trace with hash 645993075, now seen corresponding path program 1 times [2018-10-27 06:07:47,152 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:47,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:47,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:47,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:47,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:47,406 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-10-27 06:07:47,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:47,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:07:47,560 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35324010-5134-4912-838a-896f725846ce/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:07:47,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:47,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:47,782 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-27 06:07:47,807 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:47,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-10-27 06:07:47,848 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:47,849 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:47,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 06:07:47,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:47,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:47,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:47,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2018-10-27 06:07:47,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:07:47,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:07:47,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:47,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:47,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:47,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-10-27 06:07:47,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:07:47,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:07:47,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:47,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:47,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:07:47,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-10-27 06:07:48,009 INFO L477 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 6 case distinctions, treesize of input 26 treesize of output 57 [2018-10-27 06:07:48,033 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 06:07:48,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:48,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-10-27 06:07:48,127 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:48,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:48,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:07:48,155 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-10-27 06:07:48,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 57 [2018-10-27 06:07:48,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-10-27 06:07:48,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:48,283 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:48,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 43 [2018-10-27 06:07:48,289 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 06:07:48,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:07:48,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-10-27 06:07:48,373 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:94 [2018-10-27 06:07:48,714 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:48,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 46 [2018-10-27 06:07:48,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-10-27 06:07:48,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:48,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:48,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 06:07:48,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:37 [2018-10-27 06:07:48,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-10-27 06:07:48,839 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:07:48,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:48,848 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:07:48,849 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:48,854 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 06:07:48,854 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:48,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:48,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:48,862 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2018-10-27 06:07:48,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:48,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:07:48,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-10-27 06:07:48,891 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:48,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:48,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1422867347, now seen corresponding path program 1 times [2018-10-27 06:07:48,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:48,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:48,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:48,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:48,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:49,097 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2018-10-27 06:07:49,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 06:07:49,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-10-27 06:07:49,132 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. cyclomatic complexity: 7 Second operand 20 states. [2018-10-27 06:08:03,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:03,184 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-10-27 06:08:03,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 06:08:03,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 107 transitions. [2018-10-27 06:08:03,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2018-10-27 06:08:03,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 90 states and 94 transitions. [2018-10-27 06:08:03,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2018-10-27 06:08:03,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2018-10-27 06:08:03,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 94 transitions. [2018-10-27 06:08:03,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:03,188 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-10-27 06:08:03,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 94 transitions. [2018-10-27 06:08:03,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2018-10-27 06:08:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-27 06:08:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-10-27 06:08:03,192 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-10-27 06:08:03,192 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-10-27 06:08:03,192 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:08:03,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 79 transitions. [2018-10-27 06:08:03,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2018-10-27 06:08:03,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:03,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:03,199 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:03,199 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:03,200 INFO L793 eck$LassoCheckResult]: Stem: 1256#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1251#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1252#L11 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L11 1253#L11-1 SUMMARY for call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L11-1 1254#L12 SUMMARY for call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L12 1259#L13 SUMMARY for call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L13 1241#L28 assume true; 1226#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 1227#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 1236#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 1230#L16-1 assume main_#t~mem5 == 0;havoc main_#t~mem5; 1231#L17 SUMMARY for call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L17 1240#L28 assume true; 1286#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 1281#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 1266#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 1263#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 1247#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 1245#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 1246#L20 assume main_#t~mem6 == 0;havoc main_#t~mem6; 1250#L21 SUMMARY for call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L21 1242#L28 assume true; 1224#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 1225#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 1234#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 1235#L16-1 assume main_#t~mem5 == 0;havoc main_#t~mem5; 1238#L17 SUMMARY for call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L17 1239#L28 assume true; 1295#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 1293#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 1290#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 1228#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 1229#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 1243#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 1244#L20 assume !(main_#t~mem6 == 0);havoc main_#t~mem6; 1260#L23 [2018-10-27 06:08:03,200 INFO L795 eck$LassoCheckResult]: Loop: 1260#L23 SUMMARY for call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L23 1257#L23-1 SUMMARY for call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L23-1 1258#L24 assume main_#t~mem7 == 0;havoc main_#t~mem7; 1261#L25 SUMMARY for call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L25 1262#L28 assume true; 1291#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 1288#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 1287#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 1285#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 1269#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 1267#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 1248#L20 assume main_#t~mem6 == 0;havoc main_#t~mem6; 1249#L21 SUMMARY for call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L21 1255#L28 assume true; 1280#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 1279#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 1278#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 1277#L16-1 assume main_#t~mem5 == 0;havoc main_#t~mem5; 1276#L17 SUMMARY for call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L17 1275#L28 assume true; 1274#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 1273#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 1272#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 1270#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 1268#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 1265#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 1264#L20 assume !(main_#t~mem6 == 0);havoc main_#t~mem6; 1260#L23 [2018-10-27 06:08:03,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:03,200 INFO L82 PathProgramCache]: Analyzing trace with hash -877094052, now seen corresponding path program 1 times [2018-10-27 06:08:03,200 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:03,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:03,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:03,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:03,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:03,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:03,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1778158046, now seen corresponding path program 1 times [2018-10-27 06:08:03,238 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:03,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:03,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:03,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:03,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:03,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:03,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1628412391, now seen corresponding path program 1 times [2018-10-27 06:08:03,256 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:03,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:03,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:03,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:03,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 82 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-27 06:08:03,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:03,427 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35324010-5134-4912-838a-896f725846ce/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:03,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:03,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:03,566 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:03,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-10-27 06:08:03,589 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:03,589 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:03,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 06:08:03,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-10-27 06:08:03,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:03,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:03,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-10-27 06:08:03,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 06:08:03,635 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 06:08:03,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-10-27 06:08:03,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:03,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:03,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-10-27 06:08:03,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:08:03,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:03,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:03,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2018-10-27 06:08:03,812 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-10-27 06:08:03,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:03,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:03,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2018-10-27 06:08:03,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-10-27 06:08:03,871 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 06:08:03,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,881 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:03,881 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,887 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:03,887 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:03,894 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2018-10-27 06:08:03,910 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 72 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-27 06:08:03,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:03,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-10-27 06:08:04,279 WARN L179 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 104 [2018-10-27 06:08:04,391 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-10-27 06:08:04,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 06:08:04,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-10-27 06:08:04,392 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. cyclomatic complexity: 6 Second operand 15 states. [2018-10-27 06:08:04,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:04,653 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-10-27 06:08:04,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 06:08:04,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 84 transitions. [2018-10-27 06:08:04,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2018-10-27 06:08:04,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 84 transitions. [2018-10-27 06:08:04,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2018-10-27 06:08:04,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2018-10-27 06:08:04,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 84 transitions. [2018-10-27 06:08:04,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:04,656 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 84 transitions. [2018-10-27 06:08:04,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 84 transitions. [2018-10-27 06:08:04,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 70. [2018-10-27 06:08:04,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-27 06:08:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-10-27 06:08:04,664 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-10-27 06:08:04,664 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-10-27 06:08:04,664 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:08:04,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 73 transitions. [2018-10-27 06:08:04,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-10-27 06:08:04,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:04,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:04,666 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:04,666 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:04,666 INFO L793 eck$LassoCheckResult]: Stem: 1625#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1619#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1620#L11 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L11 1621#L11-1 SUMMARY for call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L11-1 1622#L12 SUMMARY for call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L12 1628#L13 SUMMARY for call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L13 1630#L28 assume true; 1601#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 1602#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 1606#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 1597#L16-1 assume main_#t~mem5 == 0;havoc main_#t~mem5; 1598#L17 SUMMARY for call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L17 1609#L28 assume true; 1610#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 1661#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 1659#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 1632#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 1616#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 1613#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 1614#L20 assume main_#t~mem6 == 0;havoc main_#t~mem6; 1618#L21 SUMMARY for call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L21 1624#L28 assume true; 1658#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 1657#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 1655#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 1653#L16-1 assume main_#t~mem5 == 0;havoc main_#t~mem5; 1651#L17 SUMMARY for call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L17 1649#L28 assume true; 1647#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 1645#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 1643#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 1641#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 1639#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 1637#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 1633#L20 assume !(main_#t~mem6 == 0);havoc main_#t~mem6; 1629#L23 [2018-10-27 06:08:04,666 INFO L795 eck$LassoCheckResult]: Loop: 1629#L23 SUMMARY for call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L23 1626#L23-1 SUMMARY for call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L23-1 1627#L24 assume main_#t~mem7 == 0;havoc main_#t~mem7; 1631#L25 SUMMARY for call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L25 1604#L28 assume true; 1599#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 1600#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 1605#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 1595#L16-1 assume main_#t~mem5 == 0;havoc main_#t~mem5; 1596#L17 SUMMARY for call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L17 1608#L28 assume true; 1664#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 1663#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 1662#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 1660#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 1615#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 1611#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 1612#L20 assume main_#t~mem6 == 0;havoc main_#t~mem6; 1617#L21 SUMMARY for call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L21 1623#L28 assume true; 1656#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 1654#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 1652#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 1650#L16-1 assume main_#t~mem5 == 0;havoc main_#t~mem5; 1648#L17 SUMMARY for call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L17 1646#L28 assume true; 1644#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 1642#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 1640#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 1638#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 1636#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 1635#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 1634#L20 assume !(main_#t~mem6 == 0);havoc main_#t~mem6; 1629#L23 [2018-10-27 06:08:04,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:04,667 INFO L82 PathProgramCache]: Analyzing trace with hash -877094052, now seen corresponding path program 2 times [2018-10-27 06:08:04,667 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:04,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:04,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:04,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:04,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:04,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:04,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2114478306, now seen corresponding path program 2 times [2018-10-27 06:08:04,706 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:04,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:04,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:04,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:04,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:04,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:04,727 INFO L82 PathProgramCache]: Analyzing trace with hash 55122723, now seen corresponding path program 2 times [2018-10-27 06:08:04,728 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:04,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:04,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:04,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:04,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:05,425 WARN L179 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 116 [2018-10-27 06:08:05,539 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-10-27 06:08:06,826 WARN L179 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 197 DAG size of output: 157 [2018-10-27 06:08:07,134 WARN L179 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-10-27 06:08:07,138 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:07,138 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:07,138 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:07,138 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:07,138 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:07,138 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:07,138 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:07,138 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:07,138 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Lasso [2018-10-27 06:08:07,139 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:07,139 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:07,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:07,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:07,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:07,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:07,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:07,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:07,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:07,727 WARN L179 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 117 [2018-10-27 06:08:07,899 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 98 [2018-10-27 06:08:07,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:07,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:08,463 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:08,463 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:08,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:08,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:08,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:08,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:08,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:08,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:08,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:08,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:08,465 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:08,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:08,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:08,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:08,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:08,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:08,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:08,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:08,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:08,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:08,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:08,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:08,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:08,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:08,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:08,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:08,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:08,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:08,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:08,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:08,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:08,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:08,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:08,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:08,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:08,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:08,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:08,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:08,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:08,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:08,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:08,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:08,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:08,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:08,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:08,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:08,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:08,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:08,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:08,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:08,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:08,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:08,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:08,499 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:08,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:08,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:08,499 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:08,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:08,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:08,500 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:08,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:08,512 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:08,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:08,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:08,513 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:08:08,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:08,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:08,514 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:08:08,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:08,517 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:08,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:08,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:08,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:08,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:08,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:08,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:08,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:08,526 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:08,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:08,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:08,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:08,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:08,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:08,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:08,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:08,543 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:08,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:08,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:08,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:08,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:08,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:08,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:08,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:08,546 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:08,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:08,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:08,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:08,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:08,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:08,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:08,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:08,559 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:08,569 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:08:08,570 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:08:08,570 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:08,570 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:08,571 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:08,571 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)_3) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x2~0.base) ULTIMATE.start_main_~x2~0.offset)_3 + 1 Supporting invariants [] [2018-10-27 06:08:08,943 INFO L297 tatePredicateManager]: 42 out of 42 supporting invariants were superfluous and have been removed [2018-10-27 06:08:08,945 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:08:08,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:08,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:09,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:09,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-10-27 06:08:09,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-10-27 06:08:09,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:09,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2018-10-27 06:08:09,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 06:08:09,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 06:08:09,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 06:08:09,102 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:23, output treesize:41 [2018-10-27 06:08:09,311 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-27 06:08:09,526 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 06:08:09,935 WARN L179 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2018-10-27 06:08:09,943 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:09,952 INFO L477 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 3 case distinctions, treesize of input 37 treesize of output 51 [2018-10-27 06:08:09,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 40 treesize of output 33 [2018-10-27 06:08:09,975 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:10,123 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:10,124 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:10,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 44 [2018-10-27 06:08:10,135 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-27 06:08:10,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-10-27 06:08:10,217 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:10,218 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-10-27 06:08:10,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-10-27 06:08:10,227 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:10,233 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:10,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-10-27 06:08:10,269 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:70, output treesize:121 [2018-10-27 06:08:10,724 WARN L179 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2018-10-27 06:08:10,978 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-27 06:08:11,235 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-27 06:08:11,243 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:11,254 INFO L477 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 3 case distinctions, treesize of input 39 treesize of output 55 [2018-10-27 06:08:11,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2018-10-27 06:08:11,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,286 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:11,287 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:11,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 43 [2018-10-27 06:08:11,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:11,397 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:11,417 INFO L477 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 7 case distinctions, treesize of input 43 treesize of output 74 [2018-10-27 06:08:11,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2018-10-27 06:08:11,423 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,529 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:11,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 43 [2018-10-27 06:08:11,536 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 06:08:11,621 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:11,622 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:11,624 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:11,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2018-10-27 06:08:11,631 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-27 06:08:11,732 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:11,733 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:11,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 47 [2018-10-27 06:08:11,734 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:11,798 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 06:08:11,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-10-27 06:08:11,995 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:83, output treesize:216 [2018-10-27 06:08:12,686 WARN L179 SmtUtils]: Spent 663.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-10-27 06:08:12,732 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:12,745 INFO L477 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 4 case distinctions, treesize of input 47 treesize of output 63 [2018-10-27 06:08:12,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2018-10-27 06:08:12,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:12,781 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:12,782 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:12,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2018-10-27 06:08:12,783 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:12,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:13,020 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:13,022 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-10-27 06:08:13,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-10-27 06:08:13,024 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:13,033 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:13,190 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:13,201 INFO L477 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 3 case distinctions, treesize of input 50 treesize of output 64 [2018-10-27 06:08:13,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 50 [2018-10-27 06:08:13,211 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:13,310 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:13,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-10-27 06:08:13,311 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:13,342 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:13,487 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:13,487 INFO L477 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 49 treesize of output 48 [2018-10-27 06:08:13,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 06:08:13,490 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:13,500 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:13,618 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:13,620 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-10-27 06:08:13,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-10-27 06:08:13,622 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:13,631 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:13,735 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:13,736 INFO L477 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 46 treesize of output 45 [2018-10-27 06:08:13,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 06:08:13,739 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:13,748 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:13,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-10-27 06:08:13,844 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 12 variables, input treesize:282, output treesize:297 [2018-10-27 06:08:14,664 WARN L179 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-10-27 06:08:14,715 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:14,734 INFO L477 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 7 case distinctions, treesize of input 33 treesize of output 64 [2018-10-27 06:08:14,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-10-27 06:08:14,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:14,828 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:14,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-10-27 06:08:14,829 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:14,889 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:14,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2018-10-27 06:08:14,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-27 06:08:14,940 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:14,943 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:14,944 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:14,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 48 [2018-10-27 06:08:14,951 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 06:08:15,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 06:08:15,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-10-27 06:08:15,059 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:43, output treesize:134 [2018-10-27 06:08:15,329 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:15,347 INFO L477 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 6 case distinctions, treesize of input 47 treesize of output 78 [2018-10-27 06:08:15,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2018-10-27 06:08:15,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,454 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:15,455 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:15,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2018-10-27 06:08:15,456 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:15,514 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:15,515 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:15,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2018-10-27 06:08:15,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:08:16,437 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:08:16,439 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-10-27 06:08:16,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-10-27 06:08:16,441 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,448 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,538 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:16,557 INFO L477 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 3 case distinctions, treesize of input 47 treesize of output 61 [2018-10-27 06:08:16,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2018-10-27 06:08:16,590 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,644 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:16,645 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:16,646 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:16,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-10-27 06:08:16,647 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,674 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:16,765 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:08:16,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-10-27 06:08:16,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-10-27 06:08:16,768 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,778 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 14 dim-0 vars, and 7 xjuncts. [2018-10-27 06:08:16,875 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 11 variables, input treesize:178, output treesize:276 [2018-10-27 06:08:16,984 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:16,984 INFO L477 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 40 treesize of output 39 [2018-10-27 06:08:16,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 06:08:16,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:16,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:17,017 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:17,019 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-10-27 06:08:17,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-10-27 06:08:17,022 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:17,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:17,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-10-27 06:08:17,044 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:81, output treesize:55 [2018-10-27 06:08:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:17,089 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2018-10-27 06:08:17,090 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 73 transitions. cyclomatic complexity: 5 Second operand 14 states. [2018-10-27 06:08:17,354 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 73 transitions. cyclomatic complexity: 5. Second operand 14 states. Result 109 states and 113 transitions. Complement of second has 19 states. [2018-10-27 06:08:17,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-27 06:08:17,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2018-10-27 06:08:17,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 37 transitions. Stem has 35 letters. Loop has 33 letters. [2018-10-27 06:08:17,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:17,357 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:08:17,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:17,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:17,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:17,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-10-27 06:08:17,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-10-27 06:08:17,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:17,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2018-10-27 06:08:17,463 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 06:08:17,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 06:08:17,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 06:08:17,488 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:23, output treesize:41 [2018-10-27 06:08:17,699 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-27 06:08:17,923 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 06:08:18,340 WARN L179 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2018-10-27 06:08:18,344 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:18,344 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-10-27 06:08:18,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-10-27 06:08:18,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:18,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:18,383 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:18,392 INFO L477 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 3 case distinctions, treesize of input 37 treesize of output 51 [2018-10-27 06:08:18,398 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:18,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 44 [2018-10-27 06:08:18,408 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-27 06:08:18,447 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:18,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 30 treesize of output 29 [2018-10-27 06:08:18,448 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:18,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-10-27 06:08:18,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-10-27 06:08:18,513 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:70, output treesize:121 [2018-10-27 06:08:18,970 WARN L179 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2018-10-27 06:08:19,232 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-27 06:08:19,487 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-27 06:08:19,495 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:19,506 INFO L477 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 3 case distinctions, treesize of input 39 treesize of output 55 [2018-10-27 06:08:19,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2018-10-27 06:08:19,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:19,539 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:19,540 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:19,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 43 [2018-10-27 06:08:19,541 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:19,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:19,629 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:19,650 INFO L477 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 7 case distinctions, treesize of input 43 treesize of output 74 [2018-10-27 06:08:19,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 50 [2018-10-27 06:08:19,724 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 06:08:19,891 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:19,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-10-27 06:08:19,892 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:20,009 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:20,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 43 [2018-10-27 06:08:20,016 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-27 06:08:20,125 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:20,126 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:20,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 47 [2018-10-27 06:08:20,127 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:20,179 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 06:08:20,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-10-27 06:08:20,245 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:83, output treesize:216 [2018-10-27 06:08:20,922 WARN L179 SmtUtils]: Spent 653.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-10-27 06:08:21,013 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:21,015 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-10-27 06:08:21,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-10-27 06:08:21,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,278 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:21,278 INFO L477 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 46 treesize of output 45 [2018-10-27 06:08:21,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 06:08:21,281 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,426 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:21,439 INFO L477 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 4 case distinctions, treesize of input 47 treesize of output 63 [2018-10-27 06:08:21,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2018-10-27 06:08:21,443 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,475 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:21,477 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:21,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2018-10-27 06:08:21,478 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,506 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:21,647 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:21,658 INFO L477 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 3 case distinctions, treesize of input 50 treesize of output 64 [2018-10-27 06:08:21,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-10-27 06:08:21,662 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,700 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:21,701 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:21,702 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:21,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 58 [2018-10-27 06:08:21,703 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,734 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:21,873 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:21,874 INFO L477 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 49 treesize of output 48 [2018-10-27 06:08:21,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 06:08:21,877 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:21,896 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:22,026 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:22,028 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-10-27 06:08:22,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-10-27 06:08:22,031 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:22,043 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:22,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-10-27 06:08:22,152 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 12 variables, input treesize:282, output treesize:297 [2018-10-27 06:08:22,464 WARN L179 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-10-27 06:08:22,518 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:22,542 INFO L477 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 7 case distinctions, treesize of input 33 treesize of output 64 [2018-10-27 06:08:22,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 40 [2018-10-27 06:08:22,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 06:08:22,708 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:22,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-10-27 06:08:22,710 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:22,794 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:22,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2018-10-27 06:08:22,800 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-27 06:08:22,864 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:22,866 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:22,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-10-27 06:08:22,867 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:22,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 06:08:22,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-10-27 06:08:22,951 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:43, output treesize:134 [2018-10-27 06:08:23,097 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:08:23,099 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-10-27 06:08:23,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-10-27 06:08:23,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:23,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:23,183 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:23,228 INFO L477 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 6 case distinctions, treesize of input 47 treesize of output 78 [2018-10-27 06:08:23,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-10-27 06:08:23,250 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:23,657 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:23,658 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:23,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2018-10-27 06:08:23,659 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:23,742 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:23,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-10-27 06:08:23,743 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:23,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:08:23,925 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:08:23,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-10-27 06:08:23,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-10-27 06:08:23,929 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:23,938 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:24,052 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:24,063 INFO L477 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 3 case distinctions, treesize of input 47 treesize of output 61 [2018-10-27 06:08:24,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2018-10-27 06:08:24,067 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:24,100 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:24,103 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:24,104 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:24,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-10-27 06:08:24,105 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:24,136 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:24,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 14 dim-0 vars, and 7 xjuncts. [2018-10-27 06:08:24,232 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 11 variables, input treesize:178, output treesize:276 [2018-10-27 06:08:24,380 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:24,381 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-10-27 06:08:24,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-10-27 06:08:24,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:24,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:24,413 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:24,414 INFO L477 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 40 treesize of output 39 [2018-10-27 06:08:24,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 06:08:24,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:24,424 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:24,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-10-27 06:08:24,440 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:81, output treesize:55 [2018-10-27 06:08:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:24,489 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 13 loop predicates [2018-10-27 06:08:24,489 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 73 transitions. cyclomatic complexity: 5 Second operand 14 states. [2018-10-27 06:08:25,187 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 73 transitions. cyclomatic complexity: 5. Second operand 14 states. Result 152 states and 158 transitions. Complement of second has 29 states. [2018-10-27 06:08:25,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:25,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-27 06:08:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 59 transitions. [2018-10-27 06:08:25,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 59 transitions. Stem has 35 letters. Loop has 33 letters. [2018-10-27 06:08:25,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:25,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 59 transitions. Stem has 68 letters. Loop has 33 letters. [2018-10-27 06:08:25,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:25,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 59 transitions. Stem has 35 letters. Loop has 66 letters. [2018-10-27 06:08:25,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:25,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 158 transitions. [2018-10-27 06:08:25,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-10-27 06:08:25,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 144 states and 150 transitions. [2018-10-27 06:08:25,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2018-10-27 06:08:25,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2018-10-27 06:08:25,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 150 transitions. [2018-10-27 06:08:25,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:25,195 INFO L705 BuchiCegarLoop]: Abstraction has 144 states and 150 transitions. [2018-10-27 06:08:25,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 150 transitions. [2018-10-27 06:08:25,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 122. [2018-10-27 06:08:25,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-27 06:08:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2018-10-27 06:08:25,200 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 128 transitions. [2018-10-27 06:08:25,201 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 128 transitions. [2018-10-27 06:08:25,201 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:08:25,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 128 transitions. [2018-10-27 06:08:25,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-10-27 06:08:25,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:25,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:25,203 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:25,203 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:25,203 INFO L793 eck$LassoCheckResult]: Stem: 2639#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2634#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 2635#L11 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L11 2636#L11-1 SUMMARY for call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L11-1 2637#L12 SUMMARY for call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L12 2644#L13 SUMMARY for call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L13 2648#L28 assume true; 2693#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 2714#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 2712#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 2710#L16-1 assume main_#t~mem5 == 0;havoc main_#t~mem5; 2708#L17 SUMMARY for call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L17 2707#L28 assume true; 2705#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 2703#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 2701#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 2699#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 2697#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 2696#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 2695#L20 assume main_#t~mem6 == 0;havoc main_#t~mem6; 2694#L21 SUMMARY for call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L21 2692#L28 assume true; 2690#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 2688#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 2686#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 2684#L16-1 assume main_#t~mem5 == 0;havoc main_#t~mem5; 2681#L17 SUMMARY for call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L17 2678#L28 assume true; 2675#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 2672#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 2669#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 2666#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 2663#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 2660#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 2656#L20 assume !(main_#t~mem6 == 0);havoc main_#t~mem6; 2655#L23 SUMMARY for call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L23 2647#L23-1 SUMMARY for call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L23-1 2649#L24 assume !(main_#t~mem7 == 0);havoc main_#t~mem7; 2621#L27 [2018-10-27 06:08:25,203 INFO L795 eck$LassoCheckResult]: Loop: 2621#L27 SUMMARY for call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L27 2616#L27-1 SUMMARY for call write~int(1, main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L27-1 2617#L28 assume true; 2608#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 2609#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 2652#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 2723#L16-1 assume main_#t~mem5 == 0;havoc main_#t~mem5; 2722#L17 SUMMARY for call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L17 2720#L28 assume true; 2718#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 2717#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 2716#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 2715#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 2713#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 2711#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 2709#L20 assume main_#t~mem6 == 0;havoc main_#t~mem6; 2659#L21 SUMMARY for call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L21 2706#L28 assume true; 2704#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 2702#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 2700#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 2698#L16-1 assume main_#t~mem5 == 0;havoc main_#t~mem5; 2683#L17 SUMMARY for call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L17 2680#L28 assume true; 2677#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 2674#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 2671#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 2668#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 2665#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 2662#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 2658#L20 assume !(main_#t~mem6 == 0);havoc main_#t~mem6; 2645#L23 SUMMARY for call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L23 2640#L23-1 SUMMARY for call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L23-1 2641#L24 assume !(main_#t~mem7 == 0);havoc main_#t~mem7; 2621#L27 [2018-10-27 06:08:25,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:25,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1072158539, now seen corresponding path program 1 times [2018-10-27 06:08:25,204 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:25,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:25,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:25,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:25,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:25,452 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 06:08:25,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:25,453 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35324010-5134-4912-838a-896f725846ce/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:25,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:25,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:25,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 26 treesize of output 25 [2018-10-27 06:08:25,493 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:25,495 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:25,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2018-10-27 06:08:25,518 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:25,519 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:25,520 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:25,522 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:25,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-10-27 06:08:25,523 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,530 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,542 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:21 [2018-10-27 06:08:25,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:08:25,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:25,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-10-27 06:08:25,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:08:25,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:25,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:25,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-10-27 06:08:25,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-10-27 06:08:25,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:25,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:25,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:25,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:42 [2018-10-27 06:08:26,043 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:26,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 46 [2018-10-27 06:08:26,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-10-27 06:08:26,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:26,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:42 [2018-10-27 06:08:26,290 INFO L303 Elim1Store]: Index analysis took 197 ms [2018-10-27 06:08:26,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 65 [2018-10-27 06:08:26,305 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:26,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 56 [2018-10-27 06:08:26,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 06:08:26,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-10-27 06:08:26,364 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:26,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-10-27 06:08:26,407 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:53, output treesize:98 [2018-10-27 06:08:26,525 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:26,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 76 [2018-10-27 06:08:26,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53 [2018-10-27 06:08:26,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,605 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:26,606 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:26,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2018-10-27 06:08:26,607 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:26,700 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:08:26,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51 [2018-10-27 06:08:26,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-10-27 06:08:26,711 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,722 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-10-27 06:08:26,767 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:116, output treesize:142 [2018-10-27 06:08:26,864 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:26,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 76 [2018-10-27 06:08:26,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53 [2018-10-27 06:08:26,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:26,929 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:26,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 36 [2018-10-27 06:08:26,937 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 06:08:26,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:08:26,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-10-27 06:08:26,989 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:60, output treesize:84 [2018-10-27 06:08:27,051 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:27,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 76 [2018-10-27 06:08:27,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53 [2018-10-27 06:08:27,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:27,112 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:27,114 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:27,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2018-10-27 06:08:27,115 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:27,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:08:27,206 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:08:27,208 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-10-27 06:08:27,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-10-27 06:08:27,211 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:27,221 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:27,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-2 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-10-27 06:08:27,279 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 12 variables, input treesize:106, output treesize:133 [2018-10-27 06:08:39,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-10-27 06:08:39,613 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:39,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:39,622 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:39,622 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:39,627 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 06:08:39,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:39,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:39,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:39,635 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2018-10-27 06:08:39,651 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:39,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:39,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2018-10-27 06:08:39,672 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:08:39,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:39,672 INFO L82 PathProgramCache]: Analyzing trace with hash 152917288, now seen corresponding path program 1 times [2018-10-27 06:08:39,672 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:39,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:39,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:39,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-27 06:08:39,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:39,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:08:39,712 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:39,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:08:39,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:08:39,712 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-10-27 06:08:39,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:39,757 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-10-27 06:08:39,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:08:39,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 130 transitions. [2018-10-27 06:08:39,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-10-27 06:08:39,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 120 states and 124 transitions. [2018-10-27 06:08:39,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-10-27 06:08:39,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2018-10-27 06:08:39,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 124 transitions. [2018-10-27 06:08:39,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:39,762 INFO L705 BuchiCegarLoop]: Abstraction has 120 states and 124 transitions. [2018-10-27 06:08:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 124 transitions. [2018-10-27 06:08:39,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-10-27 06:08:39,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-27 06:08:39,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2018-10-27 06:08:39,773 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 124 transitions. [2018-10-27 06:08:39,773 INFO L608 BuchiCegarLoop]: Abstraction has 120 states and 124 transitions. [2018-10-27 06:08:39,773 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:08:39,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 124 transitions. [2018-10-27 06:08:39,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-10-27 06:08:39,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:39,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:39,775 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:39,775 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:39,775 INFO L793 eck$LassoCheckResult]: Stem: 3025#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3017#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 3018#L11 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L11 3019#L11-1 SUMMARY for call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L11-1 3020#L12 SUMMARY for call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L12 3030#L13 SUMMARY for call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L13 3034#L28 assume true; 3081#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 3103#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 3101#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 3099#L16-1 assume main_#t~mem5 == 0;havoc main_#t~mem5; 3097#L17 SUMMARY for call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L17 3095#L28 assume true; 3093#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 3091#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 3089#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 3087#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 3086#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 3085#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 3083#L20 assume main_#t~mem6 == 0;havoc main_#t~mem6; 3023#L21 SUMMARY for call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L21 3024#L28 assume true; 3078#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 3075#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 3072#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 3069#L16-1 assume main_#t~mem5 == 0;havoc main_#t~mem5; 3066#L17 SUMMARY for call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L17 3063#L28 assume true; 3060#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 3057#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 3054#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 3051#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 3048#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 3045#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 3042#L20 assume !(main_#t~mem6 == 0);havoc main_#t~mem6; 3039#L23 SUMMARY for call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L23 3026#L23-1 SUMMARY for call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L23-1 3027#L24 assume main_#t~mem7 == 0;havoc main_#t~mem7; 3035#L25 SUMMARY for call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L25 3038#L28 assume true; 2993#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 2994#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 3109#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 3108#L16-1 assume main_#t~mem5 == 0;havoc main_#t~mem5; 3004#L17 SUMMARY for call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L17 3005#L28 assume true; 3008#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 3037#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 3001#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 2997#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 2998#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 3084#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 3082#L20 assume main_#t~mem6 == 0;havoc main_#t~mem6; 3021#L21 SUMMARY for call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L21 3022#L28 [2018-10-27 06:08:39,776 INFO L795 eck$LassoCheckResult]: Loop: 3022#L28 assume true; 3105#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 3104#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 3102#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 3100#L16-1 assume main_#t~mem5 == 0;havoc main_#t~mem5; 3098#L17 SUMMARY for call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L17 3096#L28 assume true; 3094#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 3092#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 3090#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 3088#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 3014#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 3010#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 3011#L20 assume main_#t~mem6 == 0;havoc main_#t~mem6; 3015#L21 SUMMARY for call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L21 3080#L28 assume true; 3077#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 3074#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 3071#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 3068#L16-1 assume main_#t~mem5 == 0;havoc main_#t~mem5; 3065#L17 SUMMARY for call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L17 3062#L28 assume true; 3059#L15 SUMMARY for call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); srcloc: L15 3056#L15-1 assume !!(main_#t~mem4 == 0);havoc main_#t~mem4; 3053#L16 SUMMARY for call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L16 3050#L16-1 assume !(main_#t~mem5 == 0);havoc main_#t~mem5; 3047#L19 SUMMARY for call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4); srcloc: L19 3044#L19-1 SUMMARY for call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L19-1 3041#L20 assume !(main_#t~mem6 == 0);havoc main_#t~mem6; 3031#L23 SUMMARY for call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4); srcloc: L23 3032#L23-1 SUMMARY for call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L23-1 3107#L24 assume main_#t~mem7 == 0;havoc main_#t~mem7; 3106#L25 SUMMARY for call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); srcloc: L25 3022#L28 [2018-10-27 06:08:39,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:39,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1654379445, now seen corresponding path program 3 times [2018-10-27 06:08:39,776 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:39,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:39,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:39,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:39,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:39,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1669396578, now seen corresponding path program 3 times [2018-10-27 06:08:39,824 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:39,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:39,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:39,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:39,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:39,844 INFO L82 PathProgramCache]: Analyzing trace with hash 692153134, now seen corresponding path program 4 times [2018-10-27 06:08:39,844 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:39,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:39,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:39,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:40,204 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 06:08:40,535 WARN L179 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-10-27 06:08:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 164 proven. 35 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-27 06:08:40,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:40,563 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35324010-5134-4912-838a-896f725846ce/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:40,575 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:08:40,610 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:08:40,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:08:40,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:40,643 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:40,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-10-27 06:08:40,657 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:40,658 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:40,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 06:08:40,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2018-10-27 06:08:40,673 INFO L477 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 11 treesize of output 8 [2018-10-27 06:08:40,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:40,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:08:40,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-10-27 06:08:40,700 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 06:08:40,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:8 [2018-10-27 06:08:40,724 INFO L477 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 11 treesize of output 8 [2018-10-27 06:08:40,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:40,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:08:40,839 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:08:40,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:08:40,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-10-27 06:08:40,868 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:08:40,870 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2018-10-27 06:08:40,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-10-27 06:08:40,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:40,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-10-27 06:08:40,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 20 [2018-10-27 06:08:40,899 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-27 06:08:40,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,904 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 06:08:40,905 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:40,911 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-10-27 06:08:40,928 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 172 proven. 32 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-27 06:08:40,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:08:40,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-10-27 06:08:41,500 WARN L179 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 113 [2018-10-27 06:08:41,640 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-10-27 06:08:41,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 06:08:41,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-10-27 06:08:41,641 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. cyclomatic complexity: 7 Second operand 13 states. [2018-10-27 06:08:41,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:41,793 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2018-10-27 06:08:41,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 06:08:41,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 115 transitions. [2018-10-27 06:08:41,796 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:08:41,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 0 states and 0 transitions. [2018-10-27 06:08:41,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:08:41,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:08:41,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:08:41,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:41,797 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:41,797 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:41,797 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:08:41,797 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:08:41,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:08:41,797 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:08:41,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:08:41,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:08:41 BoogieIcfgContainer [2018-10-27 06:08:41,805 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:08:41,807 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:08:41,807 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:08:41,807 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:08:41,808 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:34" (3/4) ... [2018-10-27 06:08:41,811 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:08:41,811 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:08:41,812 INFO L168 Benchmark]: Toolchain (without parser) took 68666.39 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 960.7 MB in the beginning and 910.1 MB in the end (delta: 50.6 MB). Peak memory consumption was 362.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:41,813 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:41,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.59 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 950.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:41,817 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.83 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 947.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:41,818 INFO L168 Benchmark]: Boogie Preprocessor took 24.93 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:41,818 INFO L168 Benchmark]: RCFGBuilder took 603.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:41,818 INFO L168 Benchmark]: BuchiAutomizer took 67714.23 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 910.1 MB in the end (delta: 213.5 MB). Peak memory consumption was 381.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:41,819 INFO L168 Benchmark]: Witness Printer took 4.63 ms. Allocated memory is still 1.3 GB. Free memory is still 910.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:41,821 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.59 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 950.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.83 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 947.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.93 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 603.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 67714.23 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 910.1 MB in the end (delta: 213.5 MB). Peak memory consumption was 381.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.63 ms. Allocated memory is still 1.3 GB. Free memory is still 910.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (6 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x0][x0] + 1 and consists of 6 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 1 and consists of 9 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x2][x2] + 1 and consists of 15 locations. 6 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 67.6s and 10 iterations. TraceHistogramMax:6. Analysis of lassos took 34.5s. Construction of modules took 2.5s. Büchi inclusion checks took 30.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 81 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 122 states and ocurred in iteration 7. Nontrivial modules had stage [2, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 9/39 HoareTripleCheckerStatistics: 164 SDtfs, 393 SDslu, 438 SDs, 0 SdLazy, 966 SolverSat, 270 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU2 SILI1 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital884 mio100 ax100 hnf100 lsp98 ukn53 mio100 lsp36 div100 bol100 ite100 ukn100 eq199 hnf87 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...