./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i --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_7c8ac0b6-9193-4479-b484-9a8b99662353/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7c8ac0b6-9193-4479-b484-9a8b99662353/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7c8ac0b6-9193-4479-b484-9a8b99662353/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7c8ac0b6-9193-4479-b484-9a8b99662353/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7c8ac0b6-9193-4479-b484-9a8b99662353/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7c8ac0b6-9193-4479-b484-9a8b99662353/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 25885afdfdd91cf9312b78ad87a032f4ef31fe0c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 13:16:00,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:16:00,556 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:16:00,565 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:16:00,565 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:16:00,565 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:16:00,566 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:16:00,567 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:16:00,568 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:16:00,569 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:16:00,570 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:16:00,570 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:16:00,571 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:16:00,571 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:16:00,572 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:16:00,573 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:16:00,573 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:16:00,574 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:16:00,576 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:16:00,577 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:16:00,577 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:16:00,578 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:16:00,580 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:16:00,580 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:16:00,580 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:16:00,581 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:16:00,582 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:16:00,583 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:16:00,583 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:16:00,584 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:16:00,584 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:16:00,585 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:16:00,585 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:16:00,585 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:16:00,585 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:16:00,586 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:16:00,586 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7c8ac0b6-9193-4479-b484-9a8b99662353/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 13:16:00,598 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:16:00,598 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:16:00,599 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:16:00,599 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:16:00,599 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 13:16:00,600 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 13:16:00,600 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 13:16:00,600 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 13:16:00,601 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 13:16:00,601 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 13:16:00,601 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 13:16:00,601 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:16:00,601 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 13:16:00,601 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:16:00,602 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:16:00,602 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 13:16:00,602 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 13:16:00,602 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 13:16:00,602 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:16:00,602 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 13:16:00,603 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 13:16:00,603 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:16:00,603 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:16:00,603 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 13:16:00,603 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:16:00,603 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 13:16:00,603 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 13:16:00,604 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 13:16:00,604 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_7c8ac0b6-9193-4479-b484-9a8b99662353/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 -> 25885afdfdd91cf9312b78ad87a032f4ef31fe0c [2018-11-10 13:16:00,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:16:00,638 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:16:00,641 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:16:00,642 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:16:00,642 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:16:00,643 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7c8ac0b6-9193-4479-b484-9a8b99662353/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-10 13:16:00,683 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7c8ac0b6-9193-4479-b484-9a8b99662353/bin-2019/uautomizer/data/9fede0beb/974cac69b8354033967d8cd9b490c7a7/FLAG9061d30f6 [2018-11-10 13:16:01,104 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:16:01,105 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7c8ac0b6-9193-4479-b484-9a8b99662353/sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-10 13:16:01,112 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7c8ac0b6-9193-4479-b484-9a8b99662353/bin-2019/uautomizer/data/9fede0beb/974cac69b8354033967d8cd9b490c7a7/FLAG9061d30f6 [2018-11-10 13:16:01,120 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7c8ac0b6-9193-4479-b484-9a8b99662353/bin-2019/uautomizer/data/9fede0beb/974cac69b8354033967d8cd9b490c7a7 [2018-11-10 13:16:01,122 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:16:01,123 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:16:01,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:16:01,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:16:01,126 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:16:01,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:16:01" (1/1) ... [2018-11-10 13:16:01,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4f6b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:01, skipping insertion in model container [2018-11-10 13:16:01,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:16:01" (1/1) ... [2018-11-10 13:16:01,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:16:01,164 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:16:01,339 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:16:01,345 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:16:01,372 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:16:01,393 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:16:01,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:01 WrapperNode [2018-11-10 13:16:01,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:16:01,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:16:01,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:16:01,395 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:16:01,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:01" (1/1) ... [2018-11-10 13:16:01,452 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:01" (1/1) ... [2018-11-10 13:16:01,467 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:16:01,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:16:01,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:16:01,468 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:16:01,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:01" (1/1) ... [2018-11-10 13:16:01,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:01" (1/1) ... [2018-11-10 13:16:01,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:01" (1/1) ... [2018-11-10 13:16:01,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:01" (1/1) ... [2018-11-10 13:16:01,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:01" (1/1) ... [2018-11-10 13:16:01,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:01" (1/1) ... [2018-11-10 13:16:01,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:01" (1/1) ... [2018-11-10 13:16:01,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:16:01,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:16:01,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:16:01,484 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:16:01,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c8ac0b6-9193-4479-b484-9a8b99662353/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-11-10 13:16:01,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 13:16:01,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 13:16:01,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:16:01,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:16:01,726 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:16:01,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:16:01 BoogieIcfgContainer [2018-11-10 13:16:01,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:16:01,727 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 13:16:01,727 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 13:16:01,730 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 13:16:01,730 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:16:01,730 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:16:01" (1/3) ... [2018-11-10 13:16:01,731 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d0ec4dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:16:01, skipping insertion in model container [2018-11-10 13:16:01,731 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:16:01,731 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:01" (2/3) ... [2018-11-10 13:16:01,731 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d0ec4dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:16:01, skipping insertion in model container [2018-11-10 13:16:01,731 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:16:01,731 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:16:01" (3/3) ... [2018-11-10 13:16:01,732 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-10 13:16:01,771 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:16:01,771 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 13:16:01,771 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 13:16:01,772 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 13:16:01,772 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:16:01,772 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:16:01,772 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 13:16:01,772 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:16:01,772 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 13:16:01,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2018-11-10 13:16:01,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 13:16:01,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:16:01,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:16:01,802 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:16:01,802 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:16:01,803 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 13:16:01,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2018-11-10 13:16:01,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 13:16:01,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:16:01,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:16:01,806 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:16:01,806 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:16:01,813 INFO L793 eck$LassoCheckResult]: Stem: 31#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~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 13#L552true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 15#L552-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 30#L553true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 28#L554true SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L554 5#L555true test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 7#L555-1true assume test_fun_#t~short7; 36#L555-5true assume !test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7; 29#L558-4true [2018-11-10 13:16:01,813 INFO L795 eck$LassoCheckResult]: Loop: 29#L558-4true assume true; 23#L558-1true SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-1 25#L558-2true assume !!!(test_fun_#t~mem8 == 0);havoc test_fun_#t~mem8; 19#L559true SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 3#L559-1true SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 4#L559-2true assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 37#L560true SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560 38#L560-1true SUMMARY for call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560-1 21#L560-2true havoc test_fun_#t~mem11; 6#L559-4true SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L559-4 24#L567true SUMMARY for call write~int(test_fun_#t~mem15 + 1, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L567 26#L567-1true havoc test_fun_#t~mem15; 29#L558-4true [2018-11-10 13:16:01,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:01,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1775970924, now seen corresponding path program 1 times [2018-11-10 13:16:01,819 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:01,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:01,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:01,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:16:01,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:16:01,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:16:01,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:16:01,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:16:01,930 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 13:16:01,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:01,930 INFO L82 PathProgramCache]: Analyzing trace with hash -108283912, now seen corresponding path program 1 times [2018-11-10 13:16:01,930 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:01,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:01,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:01,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:16:01,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:02,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:16:02,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:16:02,098 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-11-10 13:16:02,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:16:02,115 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-10 13:16:02,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:16:02,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2018-11-10 13:16:02,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 13:16:02,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 28 states and 29 transitions. [2018-11-10 13:16:02,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-10 13:16:02,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-10 13:16:02,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2018-11-10 13:16:02,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:16:02,124 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-10 13:16:02,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2018-11-10 13:16:02,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-10 13:16:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 13:16:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-10 13:16:02,143 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-10 13:16:02,143 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-10 13:16:02,143 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 13:16:02,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 29 transitions. [2018-11-10 13:16:02,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 13:16:02,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:16:02,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:16:02,144 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:16:02,144 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:16:02,145 INFO L793 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 93#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 94#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 95#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 96#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 104#L554 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L554 88#L555 test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 89#L555-1 assume !test_fun_#t~short7; 90#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 106#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 108#L555-5 assume !test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7; 102#L558-4 [2018-11-10 13:16:02,145 INFO L795 eck$LassoCheckResult]: Loop: 102#L558-4 assume true; 99#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-1 100#L558-2 assume !!!(test_fun_#t~mem8 == 0);havoc test_fun_#t~mem8; 97#L559 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 82#L559-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 83#L559-2 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 84#L560 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560 109#L560-1 SUMMARY for call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560-1 98#L560-2 havoc test_fun_#t~mem11; 86#L559-4 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L559-4 87#L567 SUMMARY for call write~int(test_fun_#t~mem15 + 1, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L567 101#L567-1 havoc test_fun_#t~mem15; 102#L558-4 [2018-11-10 13:16:02,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:02,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1606094761, now seen corresponding path program 1 times [2018-11-10 13:16:02,145 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:02,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:02,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:02,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:16:02,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:02,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:02,184 INFO L82 PathProgramCache]: Analyzing trace with hash -108283912, now seen corresponding path program 2 times [2018-11-10 13:16:02,185 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:02,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:02,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:02,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:16:02,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:02,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:02,210 INFO L82 PathProgramCache]: Analyzing trace with hash -870020192, now seen corresponding path program 1 times [2018-11-10 13:16:02,210 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:02,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:02,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:02,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:16:02,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:02,659 WARN L179 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 114 [2018-11-10 13:16:02,776 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-11-10 13:16:02,785 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:16:02,786 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:16:02,786 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:16:02,786 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:16:02,786 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:16:02,786 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:16:02,786 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:16:02,786 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:16:02,786 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-10 13:16:02,787 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:16:02,787 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:16:02,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:02,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:02,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:02,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:02,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:02,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:02,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:02,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:02,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:02,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:02,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:02,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:02,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:02,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:02,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:02,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:02,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:02,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:03,159 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2018-11-10 13:16:03,294 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2018-11-10 13:16:03,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:03,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:03,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:03,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:03,713 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:16:03,717 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:16:03,718 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-11-10 13:16:03,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:03,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:03,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:03,722 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,723 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-11-10 13:16:03,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:03,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:03,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:03,725 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,726 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-11-10 13:16:03,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:03,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:03,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:03,727 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,728 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-11-10 13:16:03,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:03,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:03,733 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,733 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-11-10 13:16:03,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:03,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:03,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:03,736 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,736 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-11-10 13:16:03,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:03,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:03,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:03,738 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,738 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-11-10 13:16:03,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:03,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:03,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:03,740 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,741 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-11-10 13:16:03,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:03,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:03,745 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,746 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-11-10 13:16:03,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:03,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:03,750 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,750 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-11-10 13:16:03,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:03,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:03,754 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,754 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-11-10 13:16:03,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:03,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:03,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:03,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,756 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-11-10 13:16:03,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:03,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:03,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:03,758 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,758 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-11-10 13:16:03,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:03,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:03,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:03,760 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,760 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-11-10 13:16:03,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:03,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:03,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:03,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,762 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-11-10 13:16:03,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:03,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:03,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:03,764 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,764 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-11-10 13:16:03,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:03,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:03,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:03,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,766 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-11-10 13:16:03,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:03,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:03,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:03,768 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,768 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-11-10 13:16:03,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,769 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:16:03,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,770 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:16:03,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:03,777 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,777 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-11-10 13:16:03,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:03,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:03,783 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,783 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-11-10 13:16:03,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:03,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:03,798 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,799 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-11-10 13:16:03,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,801 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:03,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:03,805 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,806 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-11-10 13:16:03,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:03,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:03,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:03,815 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:03,815 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-11-10 13:16:03,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:03,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:03,816 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:16:03,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:03,823 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-10 13:16:03,823 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 13:16:03,881 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:16:03,898 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 13:16:03,898 INFO L444 ModelExtractionUtils]: 42 out of 46 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 13:16:03,900 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:16:03,901 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-10 13:16:03,902 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:16:03,902 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-10 13:16:03,966 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 13:16:03,973 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:16:03,973 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:16:03,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:16:04,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:16:04,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:16:04,042 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-11-10 13:16:04,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:04,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:04,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:04,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-10 13:16:04,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2018-11-10 13:16:04,074 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-11-10 13:16:04,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:04,081 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-11-10 13:16:04,082 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:04,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:16:04,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:16:04,090 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-11-10 13:16:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:16:04,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:16:04,229 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:04,243 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 55 [2018-11-10 13:16:04,248 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 48 treesize of output 41 [2018-11-10 13:16:04,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 13:16:04,276 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:04,277 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:04,278 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:04,280 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 35 treesize of output 52 [2018-11-10 13:16:04,281 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 13:16:04,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:16:04,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:16:04,348 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:56 [2018-11-10 13:16:04,418 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:04,419 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 49 treesize of output 56 [2018-11-10 13:16:04,421 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 24 treesize of output 19 [2018-11-10 13:16:04,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:04,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:04,461 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:04,476 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 68 [2018-11-10 13:16:04,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2018-11-10 13:16:04,481 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:04,513 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:04,522 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 58 [2018-11-10 13:16:04,524 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-10 13:16:04,559 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 13:16:04,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 13:16:04,617 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:96, output treesize:112 [2018-11-10 13:16:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:16:04,642 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 7 loop predicates [2018-11-10 13:16:04,643 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 29 transitions. cyclomatic complexity: 2 Second operand 14 states. [2018-11-10 13:16:04,794 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 29 transitions. cyclomatic complexity: 2. Second operand 14 states. Result 56 states and 58 transitions. Complement of second has 15 states. [2018-11-10 13:16:04,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 3 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 13:16:04,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-10 13:16:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2018-11-10 13:16:04,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 11 letters. Loop has 12 letters. [2018-11-10 13:16:04,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:16:04,797 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 13:16:04,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:16:04,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:16:04,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:16:04,835 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-11-10 13:16:04,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:04,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:04,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:04,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-10 13:16:04,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2018-11-10 13:16:04,858 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-11-10 13:16:04,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:04,876 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-11-10 13:16:04,876 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:04,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:16:04,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:16:04,882 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-11-10 13:16:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:16:04,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:16:05,008 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:05,018 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2018-11-10 13:16:05,023 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 49 treesize of output 42 [2018-11-10 13:16:05,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:05,044 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:05,045 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:05,046 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 0 case distinctions, treesize of input 32 treesize of output 45 [2018-11-10 13:16:05,047 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:05,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:16:05,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:16:05,069 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:49, output treesize:56 [2018-11-10 13:16:05,127 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:05,128 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 49 treesize of output 56 [2018-11-10 13:16:05,131 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 24 treesize of output 19 [2018-11-10 13:16:05,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:05,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:05,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:05,179 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 68 [2018-11-10 13:16:05,181 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 57 treesize of output 52 [2018-11-10 13:16:05,182 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:05,212 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:05,219 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 38 treesize of output 59 [2018-11-10 13:16:05,220 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-10 13:16:05,248 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 13:16:05,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 13:16:05,281 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:96, output treesize:112 [2018-11-10 13:16:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:16:05,351 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 8 loop predicates [2018-11-10 13:16:05,351 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 29 transitions. cyclomatic complexity: 2 Second operand 15 states. [2018-11-10 13:16:05,515 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 29 transitions. cyclomatic complexity: 2. Second operand 15 states. Result 60 states and 63 transitions. Complement of second has 21 states. [2018-11-10 13:16:05,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 3 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-10 13:16:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-10 13:16:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2018-11-10 13:16:05,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 11 letters. Loop has 12 letters. [2018-11-10 13:16:05,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:16:05,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 23 letters. Loop has 12 letters. [2018-11-10 13:16:05,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:16:05,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 11 letters. Loop has 24 letters. [2018-11-10 13:16:05,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:16:05,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 63 transitions. [2018-11-10 13:16:05,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 13:16:05,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 50 states and 53 transitions. [2018-11-10 13:16:05,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-10 13:16:05,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-10 13:16:05,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 53 transitions. [2018-11-10 13:16:05,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:16:05,519 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-10 13:16:05,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 53 transitions. [2018-11-10 13:16:05,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-11-10 13:16:05,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 13:16:05,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-11-10 13:16:05,521 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-11-10 13:16:05,521 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-11-10 13:16:05,521 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 13:16:05,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 49 transitions. [2018-11-10 13:16:05,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 13:16:05,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:16:05,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:16:05,523 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:16:05,523 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:16:05,524 INFO L793 eck$LassoCheckResult]: Stem: 593#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 573#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 574#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 575#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 576#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 592#L554 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L554 568#L555 test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 569#L555-1 assume !test_fun_#t~short7; 570#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 594#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 596#L555-5 assume !test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7; 597#L558-4 assume true; 591#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-1 603#L558-2 assume !!!(test_fun_#t~mem8 == 0);havoc test_fun_#t~mem8; 602#L559 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 558#L559-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 559#L559-2 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 562#L562 [2018-11-10 13:16:05,524 INFO L795 eck$LassoCheckResult]: Loop: 562#L562 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L562 595#L562-1 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12; 590#L565 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L565 571#L565-1 SUMMARY for call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L565-1 572#L565-2 havoc test_fun_#t~mem14; 564#L559-4 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L559-4 565#L567 SUMMARY for call write~int(test_fun_#t~mem15 + 1, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L567 586#L567-1 havoc test_fun_#t~mem15; 588#L558-4 assume true; 582#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-1 583#L558-2 assume !!!(test_fun_#t~mem8 == 0);havoc test_fun_#t~mem8; 577#L559 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 578#L559-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 601#L559-2 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 562#L562 [2018-11-10 13:16:05,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:05,524 INFO L82 PathProgramCache]: Analyzing trace with hash -77450572, now seen corresponding path program 1 times [2018-11-10 13:16:05,524 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:05,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:05,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:05,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:16:05,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:05,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:05,545 INFO L82 PathProgramCache]: Analyzing trace with hash 756935287, now seen corresponding path program 1 times [2018-11-10 13:16:05,545 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:05,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:05,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:05,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:16:05,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:05,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:05,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1143728106, now seen corresponding path program 1 times [2018-11-10 13:16:05,559 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:05,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:05,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:05,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:16:05,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:05,998 WARN L179 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 123 [2018-11-10 13:16:06,126 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-11-10 13:16:06,131 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:16:06,132 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:16:06,132 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:16:06,132 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:16:06,132 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:16:06,132 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:16:06,132 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:16:06,132 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:16:06,132 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-10 13:16:06,132 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:16:06,132 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:16:06,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,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-11-10 13:16:06,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-11-10 13:16:06,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,421 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2018-11-10 13:16:06,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:16:06,925 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:16:06,925 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:16:06,925 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-11-10 13:16:06,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:06,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:06,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:06,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:06,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:06,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:06,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:06,928 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:06,928 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-11-10 13:16:06,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:06,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:06,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:06,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:06,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:06,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:06,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:06,936 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:06,936 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-11-10 13:16:06,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:06,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:06,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:06,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:06,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:06,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:06,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:06,937 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:06,937 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-11-10 13:16:06,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:06,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:16:06,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:06,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:06,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:06,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:16:06,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:16:06,939 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:06,939 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-11-10 13:16:06,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:06,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:06,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:06,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:06,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:06,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:06,941 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:06,941 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-11-10 13:16:06,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:06,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:06,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:06,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:06,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:06,942 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:06,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:06,944 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-11-10 13:16:06,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:06,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:06,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:06,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:06,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:06,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:06,947 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:06,947 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-11-10 13:16:06,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:06,947 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:16:06,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:06,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:06,948 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:16:06,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:06,951 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:06,951 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-11-10 13:16:06,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:06,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:06,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:06,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:06,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:06,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:06,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:06,954 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-11-10 13:16:06,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:06,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:06,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:06,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:06,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:06,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:06,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:06,959 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-11-10 13:16:06,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:06,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:06,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:06,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:06,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:06,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:06,964 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:16:06,964 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-11-10 13:16:06,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:16:06,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:16:06,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:16:06,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:16:06,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:16:06,966 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:16:06,971 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:16:06,980 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 13:16:06,980 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 13:16:06,981 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:16:06,981 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 13:16:06,982 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:16:06,982 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2018-11-10 13:16:07,042 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 13:16:07,045 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:16:07,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:16:07,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:16:07,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:16:07,089 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-11-10 13:16:07,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:07,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:07,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:07,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-10 13:16:07,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2018-11-10 13:16:07,115 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-11-10 13:16:07,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:07,120 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 10 treesize of output 4 [2018-11-10 13:16:07,120 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:07,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:16:07,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:16:07,128 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-11-10 13:16:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:16:07,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:16:07,187 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:07,188 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 35 treesize of output 34 [2018-11-10 13:16:07,190 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 34 treesize of output 25 [2018-11-10 13:16:07,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:07,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:07,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:07,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:20 [2018-11-10 13:16:07,216 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 23 treesize of output 24 [2018-11-10 13:16:07,219 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 10 treesize of output 9 [2018-11-10 13:16:07,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:07,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:07,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:07,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:20 [2018-11-10 13:16:07,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:16:07,235 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 5 loop predicates [2018-11-10 13:16:07,235 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 49 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-11-10 13:16:07,348 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 49 transitions. cyclomatic complexity: 5. Second operand 10 states. Result 94 states and 99 transitions. Complement of second has 13 states. [2018-11-10 13:16:07,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 13:16:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 13:16:07,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2018-11-10 13:16:07,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 53 transitions. Stem has 17 letters. Loop has 14 letters. [2018-11-10 13:16:07,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:16:07,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 53 transitions. Stem has 31 letters. Loop has 14 letters. [2018-11-10 13:16:07,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:16:07,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 53 transitions. Stem has 17 letters. Loop has 28 letters. [2018-11-10 13:16:07,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:16:07,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 99 transitions. [2018-11-10 13:16:07,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 13:16:07,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 87 states and 91 transitions. [2018-11-10 13:16:07,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-10 13:16:07,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2018-11-10 13:16:07,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 91 transitions. [2018-11-10 13:16:07,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 13:16:07,353 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-11-10 13:16:07,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 91 transitions. [2018-11-10 13:16:07,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2018-11-10 13:16:07,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 13:16:07,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-11-10 13:16:07,357 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-11-10 13:16:07,357 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-11-10 13:16:07,357 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 13:16:07,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 74 transitions. [2018-11-10 13:16:07,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 13:16:07,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:16:07,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:16:07,359 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:16:07,359 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:16:07,359 INFO L793 eck$LassoCheckResult]: Stem: 974#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 951#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 952#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 955#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 956#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 973#L554 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L554 944#L555 test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 945#L555-1 assume !test_fun_#t~short7; 946#L555-3 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-3 975#L555-4 test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 979#L555-5 assume !test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short7; 972#L558-4 assume true; 962#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-1 963#L558-2 assume !!!(test_fun_#t~mem8 == 0);havoc test_fun_#t~mem8; 957#L559 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 958#L559-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 1000#L559-2 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 976#L562 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L562 977#L562-1 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12; 971#L565 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L565 949#L565-1 SUMMARY for call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L565-1 950#L565-2 havoc test_fun_#t~mem14; 940#L559-4 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L559-4 941#L567 SUMMARY for call write~int(test_fun_#t~mem15 + 1, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L567 966#L567-1 havoc test_fun_#t~mem15; 968#L558-4 assume true; 1003#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-1 1002#L558-2 assume !!!(test_fun_#t~mem8 == 0);havoc test_fun_#t~mem8; 1001#L559 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 934#L559-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 935#L559-2 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 938#L560 [2018-11-10 13:16:07,359 INFO L795 eck$LassoCheckResult]: Loop: 938#L560 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560 981#L560-1 SUMMARY for call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560-1 960#L560-2 havoc test_fun_#t~mem11; 953#L559-4 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L559-4 999#L567 SUMMARY for call write~int(test_fun_#t~mem15 + 1, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L567 998#L567-1 havoc test_fun_#t~mem15; 996#L558-4 assume true; 994#L558-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-1 992#L558-2 assume !!!(test_fun_#t~mem8 == 0);havoc test_fun_#t~mem8; 990#L559 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 988#L559-1 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 986#L559-2 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9; 938#L560 [2018-11-10 13:16:07,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:07,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1143728101, now seen corresponding path program 1 times [2018-11-10 13:16:07,359 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:07,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:07,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:07,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:16:07,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:16:07,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:16:07,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:16:07,601 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c8ac0b6-9193-4479-b484-9a8b99662353/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-11-10 13:16:07,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:16:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:16:07,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:16:07,660 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:07,661 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-11-10 13:16:07,672 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:07,673 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:07,673 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-11-10 13:16:07,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:07,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:07,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:07,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2018-11-10 13:16:07,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-11-10 13:16:07,703 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-11-10 13:16:07,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:07,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:07,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:07,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-11-10 13:16:07,714 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-11-10 13:16:07,716 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-11-10 13:16:07,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:07,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:07,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:07,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-11-10 13:16:07,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:07,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:07,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:07,963 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 47 treesize of output 64 [2018-11-10 13:16:07,982 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 57 [2018-11-10 13:16:07,985 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 3 dim-0 vars, and 7 xjuncts. [2018-11-10 13:16:08,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:16:08,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:16:08,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:91 [2018-11-10 13:16:08,108 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:08,109 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:16:08,113 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 54 treesize of output 59 [2018-11-10 13:16:08,129 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 37 [2018-11-10 13:16:08,131 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 13:16:08,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:08,174 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 56 treesize of output 51 [2018-11-10 13:16:08,177 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 16 treesize of output 9 [2018-11-10 13:16:08,178 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:08,185 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:08,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:16:08,202 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:111, output treesize:59 [2018-11-10 13:16:08,277 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 41 treesize of output 31 [2018-11-10 13:16:08,279 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 13:16:08,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:08,285 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-11-10 13:16:08,286 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:08,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:08,303 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 39 treesize of output 33 [2018-11-10 13:16:08,305 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 13:16:08,306 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:08,314 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2018-11-10 13:16:08,315 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 13:16:08,318 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:16:08,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:16:08,326 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:81, output treesize:21 [2018-11-10 13:16:08,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:16:08,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:16:08,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2018-11-10 13:16:08,372 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 13:16:08,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:16:08,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1326384200, now seen corresponding path program 3 times [2018-11-10 13:16:08,372 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:16:08,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:16:08,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:08,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:16:08,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:16:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:16:08,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-10 13:16:08,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2018-11-10 13:16:08,464 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. cyclomatic complexity: 7 Second operand 28 states. [2018-11-10 13:16:09,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:16:09,242 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2018-11-10 13:16:09,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 13:16:09,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 100 transitions. [2018-11-10 13:16:09,243 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:16:09,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 0 states and 0 transitions. [2018-11-10 13:16:09,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 13:16:09,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 13:16:09,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 13:16:09,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:16:09,244 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:16:09,244 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:16:09,244 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:16:09,244 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 13:16:09,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:16:09,244 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:16:09,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 13:16:09,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:16:09 BoogieIcfgContainer [2018-11-10 13:16:09,248 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 13:16:09,248 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:16:09,248 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:16:09,248 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:16:09,248 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:16:01" (3/4) ... [2018-11-10 13:16:09,250 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 13:16:09,251 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:16:09,251 INFO L168 Benchmark]: Toolchain (without parser) took 8128.45 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 379.6 MB). Free memory was 956.5 MB in the beginning and 1.2 GB in the end (delta: -244.9 MB). Peak memory consumption was 134.6 MB. Max. memory is 11.5 GB. [2018-11-10 13:16:09,252 INFO L168 Benchmark]: CDTParser took 0.14 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-11-10 13:16:09,252 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.41 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 935.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:16:09,252 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 935.0 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-11-10 13:16:09,253 INFO L168 Benchmark]: Boogie Preprocessor took 15.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:16:09,253 INFO L168 Benchmark]: RCFGBuilder took 243.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:16:09,253 INFO L168 Benchmark]: BuchiAutomizer took 7520.36 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 256.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -110.0 MB). Peak memory consumption was 146.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:16:09,254 INFO L168 Benchmark]: Witness Printer took 2.76 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:16:09,256 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.14 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 270.41 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 935.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 935.0 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 243.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7520.36 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 256.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -110.0 MB). Peak memory consumption was 146.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.76 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. 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 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 12 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.4s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 4.7s. Construction of modules took 0.4s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 70 states and ocurred in iteration 3. Nontrivial modules had stage [1, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 94 SDtfs, 350 SDslu, 266 SDs, 0 SdLazy, 659 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital341 mio100 ax105 hnf100 lsp92 ukn76 mio100 lsp38 div100 bol100 ite100 ukn100 eq189 hnf88 smp90 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 86ms VariablesStem: 8 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...