./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.18-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_c6f67a8f-6575-4413-833f-ecc397b54b0b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c6f67a8f-6575-4413-833f-ecc397b54b0b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c6f67a8f-6575-4413-833f-ecc397b54b0b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c6f67a8f-6575-4413-833f-ecc397b54b0b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c6f67a8f-6575-4413-833f-ecc397b54b0b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c6f67a8f-6575-4413-833f-ecc397b54b0b/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 abee338f12eaa8176313da7ed567414f687b7fa7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 10:28:09,470 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:28:09,471 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:28:09,478 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:28:09,479 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:28:09,479 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:28:09,480 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:28:09,481 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:28:09,482 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:28:09,482 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:28:09,483 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:28:09,483 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:28:09,484 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:28:09,485 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:28:09,485 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:28:09,486 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:28:09,486 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:28:09,489 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:28:09,491 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:28:09,492 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:28:09,493 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:28:09,494 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:28:09,495 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:28:09,495 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:28:09,495 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:28:09,495 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:28:09,496 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:28:09,496 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:28:09,497 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:28:09,498 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:28:09,498 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:28:09,499 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:28:09,499 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:28:09,499 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:28:09,500 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:28:09,500 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:28:09,501 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c6f67a8f-6575-4413-833f-ecc397b54b0b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 10:28:09,511 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:28:09,511 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:28:09,512 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:28:09,512 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:28:09,512 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:28:09,513 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 10:28:09,513 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 10:28:09,513 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 10:28:09,513 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 10:28:09,513 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 10:28:09,513 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 10:28:09,513 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:28:09,513 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:28:09,514 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:28:09,514 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:28:09,514 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 10:28:09,514 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 10:28:09,514 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 10:28:09,514 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:28:09,514 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 10:28:09,514 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 10:28:09,515 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:28:09,515 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:28:09,515 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 10:28:09,515 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:28:09,515 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:28:09,515 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 10:28:09,516 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 10:28:09,516 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_c6f67a8f-6575-4413-833f-ecc397b54b0b/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 -> abee338f12eaa8176313da7ed567414f687b7fa7 [2018-11-10 10:28:09,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:28:09,550 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:28:09,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:28:09,554 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:28:09,554 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:28:09,555 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c6f67a8f-6575-4413-833f-ecc397b54b0b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca_true-termination_true-no-overflow.c.i [2018-11-10 10:28:09,599 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c6f67a8f-6575-4413-833f-ecc397b54b0b/bin-2019/uautomizer/data/470030b28/e27e869e43714776b2887a8a60124fae/FLAGe180fee6d [2018-11-10 10:28:10,023 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:28:10,023 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c6f67a8f-6575-4413-833f-ecc397b54b0b/sv-benchmarks/c/termination-memory-alloca/b.18-alloca_true-termination_true-no-overflow.c.i [2018-11-10 10:28:10,030 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c6f67a8f-6575-4413-833f-ecc397b54b0b/bin-2019/uautomizer/data/470030b28/e27e869e43714776b2887a8a60124fae/FLAGe180fee6d [2018-11-10 10:28:10,039 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c6f67a8f-6575-4413-833f-ecc397b54b0b/bin-2019/uautomizer/data/470030b28/e27e869e43714776b2887a8a60124fae [2018-11-10 10:28:10,040 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:28:10,041 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:28:10,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:28:10,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:28:10,044 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:28:10,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:28:10" (1/1) ... [2018-11-10 10:28:10,046 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 10:28:10, skipping insertion in model container [2018-11-10 10:28:10,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:28:10" (1/1) ... [2018-11-10 10:28:10,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:28:10,084 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:28:10,279 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:28:10,288 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:28:10,316 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:28:10,347 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:28:10,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:10 WrapperNode [2018-11-10 10:28:10,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:28:10,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:28:10,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:28:10,348 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:28:10,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:10" (1/1) ... [2018-11-10 10:28:10,405 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:10" (1/1) ... [2018-11-10 10:28:10,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:28:10,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:28:10,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:28:10,421 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:28:10,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:10" (1/1) ... [2018-11-10 10:28:10,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:10" (1/1) ... [2018-11-10 10:28:10,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:10" (1/1) ... [2018-11-10 10:28:10,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:10" (1/1) ... [2018-11-10 10:28:10,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:10" (1/1) ... [2018-11-10 10:28:10,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:10" (1/1) ... [2018-11-10 10:28:10,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:10" (1/1) ... [2018-11-10 10:28:10,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:28:10,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:28:10,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:28:10,436 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:28:10,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6f67a8f-6575-4413-833f-ecc397b54b0b/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 10:28:10,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 10:28:10,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 10:28:10,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:28:10,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:28:10,660 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:28:10,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:28:10 BoogieIcfgContainer [2018-11-10 10:28:10,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:28:10,662 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 10:28:10,662 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 10:28:10,665 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 10:28:10,665 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:28:10,665 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:28:10" (1/3) ... [2018-11-10 10:28:10,666 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48e23e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:28:10, skipping insertion in model container [2018-11-10 10:28:10,666 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:28:10,666 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:10" (2/3) ... [2018-11-10 10:28:10,667 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48e23e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:28:10, skipping insertion in model container [2018-11-10 10:28:10,667 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:28:10,667 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:28:10" (3/3) ... [2018-11-10 10:28:10,668 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.18-alloca_true-termination_true-no-overflow.c.i [2018-11-10 10:28:10,709 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:28:10,709 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 10:28:10,709 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 10:28:10,710 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 10:28:10,710 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:28:10,710 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:28:10,710 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 10:28:10,710 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:28:10,710 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 10:28:10,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2018-11-10 10:28:10,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-11-10 10:28:10,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:28:10,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:28:10,743 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 10:28:10,743 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:10,743 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 10:28:10,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2018-11-10 10:28:10,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-11-10 10:28:10,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:28:10,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:28:10,745 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 10:28:10,745 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:10,750 INFO L793 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, 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_~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; 32#L551true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 36#L551-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 8#L559-5true [2018-11-10 10:28:10,751 INFO L795 eck$LassoCheckResult]: Loop: 8#L559-5true assume true; 25#L553true SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 30#L553-1true test_fun_#t~short6 := test_fun_#t~mem4 > 0; 33#L553-2true assume !test_fun_#t~short6; 17#L553-6true assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6; 21#L554true SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L554 11#L554-1true SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554-1 12#L554-2true assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 34#L555-4true assume !true; 8#L559-5true [2018-11-10 10:28:10,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:10,754 INFO L82 PathProgramCache]: Analyzing trace with hash 925540, now seen corresponding path program 1 times [2018-11-10 10:28:10,755 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:10,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:10,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:10,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:10,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:10,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:10,848 INFO L82 PathProgramCache]: Analyzing trace with hash 187852671, now seen corresponding path program 1 times [2018-11-10 10:28:10,848 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:10,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:10,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:10,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:10,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:10,887 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 10:28:10,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:28:10,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:28:10,891 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:28:10,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:28:10,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:28:10,902 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2018-11-10 10:28:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:10,921 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-10 10:28:10,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:28:10,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 46 transitions. [2018-11-10 10:28:10,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-11-10 10:28:10,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 26 states and 29 transitions. [2018-11-10 10:28:10,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-10 10:28:10,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-10 10:28:10,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2018-11-10 10:28:10,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:28:10,929 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-10 10:28:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2018-11-10 10:28:10,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-10 10:28:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-10 10:28:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-10 10:28:10,951 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-10 10:28:10,951 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-10 10:28:10,951 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 10:28:10,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 29 transitions. [2018-11-10 10:28:10,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-11-10 10:28:10,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:28:10,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:28:10,952 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 10:28:10,952 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:10,953 INFO L793 eck$LassoCheckResult]: Stem: 108#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 96#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, 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_~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; 97#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 110#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 90#L559-5 [2018-11-10 10:28:10,953 INFO L795 eck$LassoCheckResult]: Loop: 90#L559-5 assume true; 95#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 107#L553-1 test_fun_#t~short6 := test_fun_#t~mem4 > 0; 109#L553-2 assume test_fun_#t~short6; 111#L553-3 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-3 112#L553-4 test_fun_#t~short6 := test_fun_#t~mem5 > 0; 102#L553-6 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6; 103#L554 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L554 98#L554-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554-1 99#L554-2 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 100#L555-4 assume true; 93#L555-1 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-1 94#L555-2 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 90#L559-5 [2018-11-10 10:28:10,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:10,953 INFO L82 PathProgramCache]: Analyzing trace with hash 925540, now seen corresponding path program 2 times [2018-11-10 10:28:10,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:10,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:10,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:10,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:10,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:10,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:10,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1265735655, now seen corresponding path program 1 times [2018-11-10 10:28:10,976 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:10,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:10,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:10,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:28:10,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:11,047 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 10:28:11,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:28:11,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:28:11,048 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:28:11,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:28:11,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:28:11,049 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-10 10:28:11,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:11,138 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-10 10:28:11,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:28:11,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 44 transitions. [2018-11-10 10:28:11,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2018-11-10 10:28:11,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 44 transitions. [2018-11-10 10:28:11,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-10 10:28:11,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-10 10:28:11,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 44 transitions. [2018-11-10 10:28:11,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:28:11,142 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-10 10:28:11,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 44 transitions. [2018-11-10 10:28:11,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2018-11-10 10:28:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 10:28:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-10 10:28:11,144 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-10 10:28:11,144 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-10 10:28:11,144 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 10:28:11,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 32 transitions. [2018-11-10 10:28:11,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-10 10:28:11,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:28:11,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:28:11,147 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 10:28:11,147 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:11,147 INFO L793 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 177#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, 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_~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; 178#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 193#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 171#L559-5 [2018-11-10 10:28:11,147 INFO L795 eck$LassoCheckResult]: Loop: 171#L559-5 assume true; 176#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 189#L553-1 test_fun_#t~short6 := test_fun_#t~mem4 > 0; 191#L553-2 assume test_fun_#t~short6; 192#L553-3 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-3 194#L553-4 test_fun_#t~short6 := test_fun_#t~mem5 > 0; 183#L553-6 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6; 184#L554 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L554 179#L554-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554-1 180#L554-2 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 173#L559-4 assume true; 169#L559-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 170#L559-2 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 171#L559-5 [2018-11-10 10:28:11,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:11,147 INFO L82 PathProgramCache]: Analyzing trace with hash 925540, now seen corresponding path program 3 times [2018-11-10 10:28:11,148 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:11,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:11,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:11,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:11,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:11,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:11,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1265150759, now seen corresponding path program 1 times [2018-11-10 10:28:11,165 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:11,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:11,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:11,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:28:11,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:11,205 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 10:28:11,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:28:11,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:28:11,205 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:28:11,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:28:11,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:28:11,206 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-10 10:28:11,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:11,291 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-10 10:28:11,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:28:11,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 39 transitions. [2018-11-10 10:28:11,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2018-11-10 10:28:11,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 39 transitions. [2018-11-10 10:28:11,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-10 10:28:11,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-10 10:28:11,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 39 transitions. [2018-11-10 10:28:11,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:28:11,294 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-11-10 10:28:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 39 transitions. [2018-11-10 10:28:11,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-11-10 10:28:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-10 10:28:11,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-10 10:28:11,296 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-10 10:28:11,296 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-10 10:28:11,297 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 10:28:11,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 35 transitions. [2018-11-10 10:28:11,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 10:28:11,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:28:11,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:28:11,298 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 10:28:11,298 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:11,298 INFO L793 eck$LassoCheckResult]: Stem: 270#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 255#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, 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_~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; 256#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 272#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 251#L559-5 [2018-11-10 10:28:11,298 INFO L795 eck$LassoCheckResult]: Loop: 251#L559-5 assume true; 252#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 268#L553-1 test_fun_#t~short6 := test_fun_#t~mem4 > 0; 271#L553-2 assume test_fun_#t~short6; 273#L553-3 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-3 274#L553-4 test_fun_#t~short6 := test_fun_#t~mem5 > 0; 262#L553-6 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6; 263#L554 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L554 257#L554-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554-1 258#L554-2 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 259#L555-4 assume true; 278#L555-1 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-1 269#L555-2 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 264#L556 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 265#L556-1 SUMMARY for call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 266#L556-2 havoc test_fun_#t~mem10; 267#L555-4 assume true; 253#L555-1 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-1 254#L555-2 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 251#L559-5 [2018-11-10 10:28:11,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:11,299 INFO L82 PathProgramCache]: Analyzing trace with hash 925540, now seen corresponding path program 4 times [2018-11-10 10:28:11,299 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:11,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:11,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:11,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:11,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:11,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:11,318 INFO L82 PathProgramCache]: Analyzing trace with hash -154976075, now seen corresponding path program 1 times [2018-11-10 10:28:11,318 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:11,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:11,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:11,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:28:11,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:11,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:28:11,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:28:11,443 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6f67a8f-6575-4413-833f-ecc397b54b0b/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 10:28:11,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:11,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:11,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2018-11-10 10:28:11,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-11-10 10:28:11,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:11,678 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:28:11,679 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:28:11,687 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 33 treesize of output 44 [2018-11-10 10:28:11,688 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:11,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:28:11,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 10:28:11,732 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:47 [2018-11-10 10:28:11,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 22 [2018-11-10 10:28:11,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-10 10:28:11,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:11,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:11,798 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 30 treesize of output 22 [2018-11-10 10:28:11,800 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 13 treesize of output 9 [2018-11-10 10:28:11,800 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:11,806 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 11 treesize of output 7 [2018-11-10 10:28:11,807 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:11,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:11,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:11,816 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:61, output treesize:3 [2018-11-10 10:28:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:28:11,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:28:11,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-11-10 10:28:11,840 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:28:11,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 10:28:11,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-11-10 10:28:11,841 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. cyclomatic complexity: 4 Second operand 18 states. [2018-11-10 10:28:12,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:12,069 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-10 10:28:12,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 10:28:12,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 45 transitions. [2018-11-10 10:28:12,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 10:28:12,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 45 transitions. [2018-11-10 10:28:12,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-10 10:28:12,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-10 10:28:12,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 45 transitions. [2018-11-10 10:28:12,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:28:12,072 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-10 10:28:12,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 45 transitions. [2018-11-10 10:28:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-11-10 10:28:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-10 10:28:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-11-10 10:28:12,074 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-10 10:28:12,074 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-10 10:28:12,074 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 10:28:12,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 41 transitions. [2018-11-10 10:28:12,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2018-11-10 10:28:12,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:28:12,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:28:12,076 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 10:28:12,076 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:12,076 INFO L793 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 422#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, 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_~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; 423#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 440#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 420#L559-5 [2018-11-10 10:28:12,077 INFO L795 eck$LassoCheckResult]: Loop: 420#L559-5 assume true; 421#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 436#L553-1 test_fun_#t~short6 := test_fun_#t~mem4 > 0; 438#L553-2 assume test_fun_#t~short6; 441#L553-3 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-3 442#L553-4 test_fun_#t~short6 := test_fun_#t~mem5 > 0; 429#L553-6 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6; 430#L554 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L554 424#L554-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554-1 425#L554-2 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 417#L559-4 assume true; 414#L559-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 415#L559-2 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 416#L560 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560 443#L560-1 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560-1 427#L560-2 havoc test_fun_#t~mem12; 428#L559-4 assume true; 446#L559-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 445#L559-2 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 420#L559-5 [2018-11-10 10:28:12,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:12,077 INFO L82 PathProgramCache]: Analyzing trace with hash 925540, now seen corresponding path program 5 times [2018-11-10 10:28:12,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:12,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:12,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:12,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:12,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:12,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:12,091 INFO L82 PathProgramCache]: Analyzing trace with hash -577217387, now seen corresponding path program 1 times [2018-11-10 10:28:12,091 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:12,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:12,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:12,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:28:12,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:12,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:12,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1017789358, now seen corresponding path program 1 times [2018-11-10 10:28:12,112 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:12,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:12,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:12,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:12,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:12,344 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2018-11-10 10:28:12,394 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:28:12,394 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:28:12,395 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:28:12,395 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:28:12,395 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:28:12,395 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:28:12,395 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:28:12,395 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:28:12,395 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-10 10:28:12,396 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:28:12,396 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:28:12,409 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 10:28:12,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:28:12,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:28:12,414 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 10:28:12,416 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 10:28:12,417 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 10:28:12,419 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 10:28:12,420 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 10:28:12,422 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 10:28:12,423 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 10:28:12,424 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 10:28:12,425 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 10:28:12,426 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 10:28:12,427 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 10:28:12,428 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 10:28:12,429 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 10:28:12,430 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 10:28:12,612 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-11-10 10:28:12,670 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 10:28:12,671 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 10:28:12,672 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 10:28:12,674 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 10:28:12,675 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 10:28:12,676 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 10:28:12,677 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 10:28:12,992 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:28:12,997 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:28:12,999 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 10:28:13,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:13,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:13,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:13,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:13,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,006 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 10:28:13,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:13,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:13,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:13,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:13,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,008 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 10:28:13,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:13,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:13,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:13,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:13,010 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,010 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 10:28:13,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:13,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:13,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:13,015 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,015 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 10:28:13,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:13,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:13,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:13,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:13,020 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,020 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 10:28:13,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:13,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:13,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:13,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,026 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 10:28:13,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:13,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:13,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:13,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:13,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,028 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 10:28:13,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:13,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:13,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:13,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,037 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 10:28:13,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:13,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:13,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:13,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:13,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,041 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 10:28:13,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:13,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:13,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:13,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:13,043 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,043 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 10:28:13,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:13,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:13,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:13,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:13,051 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,051 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 10:28:13,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:13,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:13,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:13,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:13,053 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,054 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 10:28:13,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:13,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:13,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:13,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:13,055 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,056 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 10:28:13,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:13,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:13,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:13,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:13,058 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,059 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 10:28:13,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:13,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:13,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:13,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:13,060 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,061 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 10:28:13,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:13,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:13,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:13,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:13,065 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,066 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 10:28:13,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,066 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:28:13,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,068 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:28:13,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:13,081 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,082 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 10:28:13,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:13,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:13,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:13,095 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,095 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 10:28:13,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:13,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:13,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:13,102 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,102 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 10:28:13,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:13,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:13,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:13,107 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,107 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 10:28:13,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,108 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:28:13,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,111 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:28:13,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:13,118 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:13,118 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 10:28:13,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:13,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:13,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:13,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:13,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:13,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:13,140 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:28:13,153 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 10:28:13,154 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 10:28:13,155 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:28:13,157 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 10:28:13,158 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:28:13,159 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) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2018-11-10 10:28:13,207 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 10:28:13,210 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:28:13,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:13,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:13,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:13,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 10:28:13,236 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 11 treesize of output 7 [2018-11-10 10:28:13,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:13,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:13,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:13,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:3 [2018-11-10 10:28:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 10:28:13,271 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-10 10:28:13,271 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 41 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-10 10:28:13,387 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 41 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 112 states and 121 transitions. Complement of second has 16 states. [2018-11-10 10:28:13,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-10 10:28:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 10:28:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2018-11-10 10:28:13,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 4 letters. Loop has 19 letters. [2018-11-10 10:28:13,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:28:13,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 23 letters. Loop has 19 letters. [2018-11-10 10:28:13,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:28:13,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 4 letters. Loop has 38 letters. [2018-11-10 10:28:13,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:28:13,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 121 transitions. [2018-11-10 10:28:13,391 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2018-11-10 10:28:13,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 112 states and 121 transitions. [2018-11-10 10:28:13,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2018-11-10 10:28:13,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2018-11-10 10:28:13,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 121 transitions. [2018-11-10 10:28:13,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:28:13,392 INFO L705 BuchiCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-11-10 10:28:13,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 121 transitions. [2018-11-10 10:28:13,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 71. [2018-11-10 10:28:13,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-10 10:28:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-11-10 10:28:13,395 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-11-10 10:28:13,395 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-11-10 10:28:13,395 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 10:28:13,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 78 transitions. [2018-11-10 10:28:13,396 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2018-11-10 10:28:13,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:28:13,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:28:13,396 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:28:13,396 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:13,396 INFO L793 eck$LassoCheckResult]: Stem: 763#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 738#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, 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_~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; 739#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 766#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 769#L559-5 assume true; 731#L553 [2018-11-10 10:28:13,396 INFO L795 eck$LassoCheckResult]: Loop: 731#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 761#L553-1 test_fun_#t~short6 := test_fun_#t~mem4 > 0; 764#L553-2 assume test_fun_#t~short6; 767#L553-3 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-3 770#L553-4 test_fun_#t~short6 := test_fun_#t~mem5 > 0; 749#L553-6 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6; 750#L554 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L554 740#L554-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554-1 741#L554-2 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 744#L555-4 assume true; 734#L555-1 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-1 735#L555-2 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 753#L556 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 754#L556-1 SUMMARY for call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 757#L556-2 havoc test_fun_#t~mem10; 759#L555-4 assume true; 781#L555-1 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-1 780#L555-2 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 775#L556 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 779#L556-1 SUMMARY for call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 778#L556-2 havoc test_fun_#t~mem10; 777#L555-4 assume true; 776#L555-1 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-1 774#L555-2 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 730#L559-5 assume true; 731#L553 [2018-11-10 10:28:13,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:13,397 INFO L82 PathProgramCache]: Analyzing trace with hash 28691748, now seen corresponding path program 1 times [2018-11-10 10:28:13,397 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:13,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:13,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:13,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:13,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:13,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:13,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2117992643, now seen corresponding path program 2 times [2018-11-10 10:28:13,407 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:13,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:13,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:13,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:13,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:13,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:13,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1376571526, now seen corresponding path program 1 times [2018-11-10 10:28:13,422 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:13,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:13,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:13,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:28:13,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:13,575 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2018-11-10 10:28:13,741 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2018-11-10 10:28:13,794 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:28:13,795 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:28:13,795 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:28:13,795 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:28:13,795 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:28:13,795 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:28:13,795 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:28:13,795 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:28:13,795 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca_true-termination_true-no-overflow.c.i_Iteration6_Lasso [2018-11-10 10:28:13,795 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:28:13,795 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:28:13,798 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 10:28:13,801 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 10:28:13,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 10:28:13,805 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 10:28:13,806 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 10:28:13,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 10:28:13,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 10:28:13,965 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-11-10 10:28:14,030 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 10:28:14,032 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 10:28:14,034 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 10:28:14,041 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 10:28:14,043 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 10:28:14,044 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 10:28:14,045 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 10:28:14,047 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 10:28:14,048 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 10:28:14,049 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 10:28:14,052 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 10:28:14,058 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 10:28:14,059 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 10:28:14,062 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 10:28:14,063 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 10:28:14,065 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 10:28:14,066 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 10:28:14,372 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:28:14,372 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:28:14,372 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 10:28:14,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:14,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:14,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:14,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:14,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:14,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:14,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:14,377 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:14,378 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 10:28:14,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:14,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:14,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:14,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:14,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:14,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:14,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:14,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:14,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:28:14,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:14,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:14,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:14,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:14,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:14,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:14,386 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:14,386 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 10:28:14,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:14,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:14,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:14,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:14,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:14,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:14,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:14,388 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:14,388 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 10:28:14,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:14,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:14,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:14,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:14,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:14,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:14,390 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:14,391 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 10:28:14,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:14,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:14,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:14,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:14,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:14,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:14,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:14,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:14,392 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 10:28:14,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:14,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:14,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:14,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:14,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:14,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:14,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:14,396 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 10:28:14,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:14,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:14,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:14,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:14,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:14,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:14,399 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:14,399 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 10:28:14,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:14,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:14,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:14,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:14,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:14,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:14,402 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:14,403 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 10:28:14,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:14,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:14,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:14,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:14,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:14,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:14,416 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:28:14,428 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 10:28:14,428 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 10:28:14,429 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:28:14,430 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 10:28:14,431 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:28:14,431 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 10:28:14,470 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 10:28:14,472 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:28:14,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:14,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:14,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:14,574 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 29 treesize of output 29 [2018-11-10 10:28:14,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 21 [2018-11-10 10:28:14,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 10:28:14,612 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 25 treesize of output 21 [2018-11-10 10:28:14,613 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:14,636 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 14 [2018-11-10 10:28:14,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:14,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:28:14,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:28:14,688 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:21 [2018-11-10 10:28:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 10:28:14,748 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2018-11-10 10:28:14,748 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 78 transitions. cyclomatic complexity: 10 Second operand 11 states. [2018-11-10 10:28:14,893 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 78 transitions. cyclomatic complexity: 10. Second operand 11 states. Result 192 states and 207 transitions. Complement of second has 23 states. [2018-11-10 10:28:14,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2018-11-10 10:28:14,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 10:28:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 33 transitions. [2018-11-10 10:28:14,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 33 transitions. Stem has 5 letters. Loop has 25 letters. [2018-11-10 10:28:14,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:28:14,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 33 transitions. Stem has 30 letters. Loop has 25 letters. [2018-11-10 10:28:14,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:28:14,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 33 transitions. Stem has 5 letters. Loop has 50 letters. [2018-11-10 10:28:14,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:28:14,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 207 transitions. [2018-11-10 10:28:14,899 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-11-10 10:28:14,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 167 states and 181 transitions. [2018-11-10 10:28:14,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-11-10 10:28:14,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2018-11-10 10:28:14,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 181 transitions. [2018-11-10 10:28:14,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:28:14,901 INFO L705 BuchiCegarLoop]: Abstraction has 167 states and 181 transitions. [2018-11-10 10:28:14,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 181 transitions. [2018-11-10 10:28:14,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 147. [2018-11-10 10:28:14,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-10 10:28:14,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2018-11-10 10:28:14,908 INFO L728 BuchiCegarLoop]: Abstraction has 147 states and 161 transitions. [2018-11-10 10:28:14,908 INFO L608 BuchiCegarLoop]: Abstraction has 147 states and 161 transitions. [2018-11-10 10:28:14,908 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 10:28:14,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 161 transitions. [2018-11-10 10:28:14,911 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-11-10 10:28:14,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:28:14,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:28:14,911 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:14,911 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 10:28:14,911 INFO L793 eck$LassoCheckResult]: Stem: 1220#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1194#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, 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_~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; 1195#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 1227#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 1231#L559-5 assume true; 1256#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 1254#L553-1 test_fun_#t~short6 := test_fun_#t~mem4 > 0; 1224#L553-2 assume test_fun_#t~short6; 1225#L553-3 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-3 1253#L553-4 test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1206#L553-6 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6; 1207#L554 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L554 1196#L554-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554-1 1197#L554-2 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 1184#L559-4 [2018-11-10 10:28:14,911 INFO L795 eck$LassoCheckResult]: Loop: 1184#L559-4 assume true; 1178#L559-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 1179#L559-2 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 1182#L560 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560 1232#L560-1 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560-1 1203#L560-2 havoc test_fun_#t~mem12; 1184#L559-4 [2018-11-10 10:28:14,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:14,912 INFO L82 PathProgramCache]: Analyzing trace with hash -2075480063, now seen corresponding path program 1 times [2018-11-10 10:28:14,912 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:14,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:14,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:14,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:14,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:14,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:14,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1867060347, now seen corresponding path program 1 times [2018-11-10 10:28:14,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:14,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:14,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:14,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:14,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:14,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:14,933 INFO L82 PathProgramCache]: Analyzing trace with hash 2117966725, now seen corresponding path program 1 times [2018-11-10 10:28:14,933 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:14,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:14,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:14,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:14,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:15,150 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 94 [2018-11-10 10:28:15,210 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:28:15,210 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:28:15,210 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:28:15,211 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:28:15,211 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:28:15,211 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:28:15,211 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:28:15,211 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:28:15,211 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca_true-termination_true-no-overflow.c.i_Iteration7_Lasso [2018-11-10 10:28:15,211 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:28:15,211 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:28:15,214 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 10:28:15,215 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 10:28:15,216 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 10:28:15,218 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 10:28:15,219 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 10:28:15,221 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 10:28:15,222 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 10:28:15,224 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 10:28:15,225 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 10:28:15,227 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 10:28:15,229 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 10:28:15,230 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 10:28:15,231 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 10:28:15,232 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 10:28:15,233 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 10:28:15,234 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 10:28:15,358 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2018-11-10 10:28:15,373 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 10:28:15,375 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 10:28:15,376 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 10:28:15,378 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 10:28:15,380 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 10:28:15,381 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 10:28:15,382 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 10:28:15,612 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:28:15,612 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:28:15,612 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 10:28:15,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:15,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:15,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:15,614 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,614 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 10:28:15,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:15,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:15,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:15,615 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,616 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 10:28:15,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:15,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:15,618 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,618 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 10:28:15,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:15,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:15,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:15,620 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,620 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 10:28:15,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:15,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:15,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:15,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,621 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 10:28:15,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:15,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:15,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:15,623 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,623 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 10:28:15,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:15,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:15,626 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,633 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 10:28:15,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:15,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:15,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:15,637 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,637 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 10:28:15,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:15,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:15,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:15,639 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,639 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 10:28:15,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:15,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:15,646 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,646 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 10:28:15,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:15,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:15,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:15,648 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,648 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 10:28:15,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:15,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:15,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:15,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,654 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 10:28:15,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:15,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:15,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:15,655 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,655 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 10:28:15,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:15,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:15,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:15,657 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,659 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 10:28:15,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:15,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:15,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:15,661 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,661 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 10:28:15,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:15,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:15,668 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,668 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 10:28:15,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:15,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:15,671 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,672 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 10:28:15,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:15,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:15,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,678 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 10:28:15,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:15,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:15,689 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,689 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 10:28:15,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:15,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:15,692 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,692 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 10:28:15,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,695 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:15,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:15,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,702 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 10:28:15,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,703 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:28:15,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,704 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:28:15,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:15,707 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,708 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 10:28:15,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:15,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:15,710 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,711 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 10:28:15,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:15,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:15,716 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,716 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 10:28:15,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,717 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:28:15,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,718 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:28:15,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:15,722 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:15,722 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 10:28:15,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:15,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:15,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:15,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:15,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:15,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:15,732 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:28:15,737 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 10:28:15,737 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 10:28:15,737 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:28:15,738 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 10:28:15,738 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:28:15,738 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)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 Supporting invariants [] [2018-11-10 10:28:15,763 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2018-11-10 10:28:15,765 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:28:15,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:15,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:15,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:15,819 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:28:15,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-10 10:28:15,822 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 10:28:15,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:15,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:15,832 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 10:28:15,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-11-10 10:28:15,841 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 10:28:15,842 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-10 10:28:15,842 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 147 states and 161 transitions. cyclomatic complexity: 20 Second operand 7 states. [2018-11-10 10:28:15,880 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 147 states and 161 transitions. cyclomatic complexity: 20. Second operand 7 states. Result 237 states and 259 transitions. Complement of second has 11 states. [2018-11-10 10:28:15,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 10:28:15,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 10:28:15,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-10 10:28:15,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-10 10:28:15,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:28:15,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 20 letters. Loop has 6 letters. [2018-11-10 10:28:15,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:28:15,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 14 letters. Loop has 12 letters. [2018-11-10 10:28:15,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:28:15,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 237 states and 259 transitions. [2018-11-10 10:28:15,885 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-11-10 10:28:15,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 237 states to 199 states and 215 transitions. [2018-11-10 10:28:15,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2018-11-10 10:28:15,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2018-11-10 10:28:15,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 215 transitions. [2018-11-10 10:28:15,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:28:15,887 INFO L705 BuchiCegarLoop]: Abstraction has 199 states and 215 transitions. [2018-11-10 10:28:15,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 215 transitions. [2018-11-10 10:28:15,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 179. [2018-11-10 10:28:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-10 10:28:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 195 transitions. [2018-11-10 10:28:15,894 INFO L728 BuchiCegarLoop]: Abstraction has 179 states and 195 transitions. [2018-11-10 10:28:15,894 INFO L608 BuchiCegarLoop]: Abstraction has 179 states and 195 transitions. [2018-11-10 10:28:15,894 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 10:28:15,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 179 states and 195 transitions. [2018-11-10 10:28:15,895 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-11-10 10:28:15,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:28:15,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:28:15,896 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:15,896 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 10:28:15,896 INFO L793 eck$LassoCheckResult]: Stem: 1735#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1705#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, 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_~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; 1706#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 1742#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 1700#L559-5 assume true; 1701#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 1733#L553-1 test_fun_#t~short6 := test_fun_#t~mem4 > 0; 1796#L553-2 assume test_fun_#t~short6; 1794#L553-3 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-3 1792#L553-4 test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1790#L553-6 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6; 1788#L554 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L554 1786#L554-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554-1 1785#L554-2 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 1729#L555-4 [2018-11-10 10:28:15,896 INFO L795 eck$LassoCheckResult]: Loop: 1729#L555-4 assume true; 1784#L555-1 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-1 1782#L555-2 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 1722#L556 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 1723#L556-1 SUMMARY for call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 1726#L556-2 havoc test_fun_#t~mem10; 1729#L555-4 [2018-11-10 10:28:15,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:15,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2075480082, now seen corresponding path program 1 times [2018-11-10 10:28:15,897 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:15,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:15,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:15,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:15,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:15,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:15,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1865821285, now seen corresponding path program 1 times [2018-11-10 10:28:15,910 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:15,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:15,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:15,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:15,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:15,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:15,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1873180306, now seen corresponding path program 1 times [2018-11-10 10:28:15,915 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:15,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:15,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:15,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:15,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:16,128 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2018-11-10 10:28:16,178 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:28:16,178 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:28:16,178 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:28:16,178 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:28:16,178 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:28:16,178 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:28:16,178 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:28:16,178 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:28:16,178 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2018-11-10 10:28:16,178 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:28:16,178 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:28:16,180 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 10:28:16,181 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 10:28:16,182 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 10:28:16,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:28:16,315 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 10:28:16,316 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 10:28:16,322 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 10:28:16,324 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 10:28:16,325 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 10:28:16,326 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 10:28:16,329 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 10:28:16,330 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 10:28:16,332 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 10:28:16,333 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 10:28:16,334 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 10:28:16,336 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 10:28:16,338 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 10:28:16,340 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 10:28:16,341 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 10:28:16,342 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 10:28:16,343 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 10:28:16,344 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 10:28:16,346 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 10:28:16,566 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:28:16,566 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:28:16,567 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 10:28:16,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:16,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:16,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:16,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:16,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:16,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:16,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:16,568 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:16,568 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 10:28:16,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:16,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:28:16,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:16,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:16,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:16,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:28:16,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:28:16,570 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:16,570 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 10:28:16,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:16,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:16,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:16,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:16,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:16,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:16,575 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:16,576 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 10:28:16,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:16,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:16,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:16,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:16,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:16,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:16,578 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:28:16,578 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 10:28:16,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:28:16,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:28:16,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:28:16,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:28:16,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:28:16,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:28:16,586 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:28:16,593 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 10:28:16,593 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 10:28:16,593 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:28:16,594 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 10:28:16,594 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:28:16,594 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)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4 Supporting invariants [] [2018-11-10 10:28:16,611 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2018-11-10 10:28:16,612 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:28:16,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:16,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:16,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:28:16,657 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:28:16,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-10 10:28:16,660 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 10:28:16,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:28:16,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:28:16,669 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 10:28:16,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-11-10 10:28:16,677 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 10:28:16,677 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-10 10:28:16,678 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 195 transitions. cyclomatic complexity: 23 Second operand 7 states. [2018-11-10 10:28:16,706 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 195 transitions. cyclomatic complexity: 23. Second operand 7 states. Result 456 states and 489 transitions. Complement of second has 11 states. [2018-11-10 10:28:16,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 10:28:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 10:28:16,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-10 10:28:16,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-10 10:28:16,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:28:16,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 20 letters. Loop has 6 letters. [2018-11-10 10:28:16,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:28:16,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 14 letters. Loop has 12 letters. [2018-11-10 10:28:16,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:28:16,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 456 states and 489 transitions. [2018-11-10 10:28:16,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2018-11-10 10:28:16,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 456 states to 294 states and 313 transitions. [2018-11-10 10:28:16,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-11-10 10:28:16,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-11-10 10:28:16,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 294 states and 313 transitions. [2018-11-10 10:28:16,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:28:16,714 INFO L705 BuchiCegarLoop]: Abstraction has 294 states and 313 transitions. [2018-11-10 10:28:16,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states and 313 transitions. [2018-11-10 10:28:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 250. [2018-11-10 10:28:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-10 10:28:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 269 transitions. [2018-11-10 10:28:16,721 INFO L728 BuchiCegarLoop]: Abstraction has 250 states and 269 transitions. [2018-11-10 10:28:16,721 INFO L608 BuchiCegarLoop]: Abstraction has 250 states and 269 transitions. [2018-11-10 10:28:16,721 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 10:28:16,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 250 states and 269 transitions. [2018-11-10 10:28:16,723 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2018-11-10 10:28:16,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:28:16,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:28:16,724 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:28:16,724 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 10:28:16,724 INFO L793 eck$LassoCheckResult]: Stem: 2498#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2464#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, 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_~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; 2465#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 2506#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 2460#L559-5 assume true; 2461#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 2608#L553-1 test_fun_#t~short6 := test_fun_#t~mem4 > 0; 2607#L553-2 assume test_fun_#t~short6; 2606#L553-3 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-3 2605#L553-4 test_fun_#t~short6 := test_fun_#t~mem5 > 0; 2604#L553-6 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6; 2603#L554 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L554 2602#L554-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554-1 2601#L554-2 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 2597#L559-4 assume true; 2598#L559-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 2560#L559-2 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 2558#L560 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560 2556#L560-1 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560-1 2553#L560-2 havoc test_fun_#t~mem12; 2550#L559-4 assume true; 2549#L559-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 2547#L559-2 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 2544#L559-5 assume true; 2541#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 2540#L553-1 test_fun_#t~short6 := test_fun_#t~mem4 > 0; 2539#L553-2 assume test_fun_#t~short6; 2538#L553-3 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-3 2537#L553-4 test_fun_#t~short6 := test_fun_#t~mem5 > 0; 2476#L553-6 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6; 2477#L554 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L554 2466#L554-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554-1 2467#L554-2 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 2470#L555-4 assume true; 2502#L555-1 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-1 2581#L555-2 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 2580#L556 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 2579#L556-1 SUMMARY for call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 2578#L556-2 havoc test_fun_#t~mem10; 2575#L555-4 assume true; 2576#L555-1 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-1 2572#L555-2 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 2571#L556 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 2569#L556-1 SUMMARY for call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 2566#L556-2 havoc test_fun_#t~mem10; 2563#L555-4 assume true; 2456#L555-1 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-1 2457#L555-2 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 2494#L559-5 assume true; 2548#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 2546#L553-1 test_fun_#t~short6 := test_fun_#t~mem4 > 0; 2542#L553-2 assume test_fun_#t~short6; 2507#L553-3 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-3 2508#L553-4 test_fun_#t~short6 := test_fun_#t~mem5 > 0; 2513#L553-6 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6; 2519#L554 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L554 2520#L554-1 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554-1 2514#L554-2 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 2454#L559-4 [2018-11-10 10:28:16,724 INFO L795 eck$LassoCheckResult]: Loop: 2454#L559-4 assume true; 2447#L559-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 2448#L559-2 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 2451#L560 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560 2510#L560-1 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560-1 2472#L560-2 havoc test_fun_#t~mem12; 2454#L559-4 [2018-11-10 10:28:16,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:16,724 INFO L82 PathProgramCache]: Analyzing trace with hash 216257213, now seen corresponding path program 1 times [2018-11-10 10:28:16,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:16,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:16,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:16,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:16,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:28:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 10:28:16,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:28:16,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:28:16,774 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 10:28:16,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:28:16,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1867060347, now seen corresponding path program 2 times [2018-11-10 10:28:16,774 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:28:16,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:28:16,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:16,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:28:16,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:28:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:28:16,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:28:16,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:28:16,791 INFO L87 Difference]: Start difference. First operand 250 states and 269 transitions. cyclomatic complexity: 27 Second operand 6 states. [2018-11-10 10:28:16,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:28:16,824 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2018-11-10 10:28:16,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:28:16,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 119 transitions. [2018-11-10 10:28:16,825 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:28:16,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 0 states and 0 transitions. [2018-11-10 10:28:16,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 10:28:16,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 10:28:16,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 10:28:16,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:28:16,825 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:28:16,826 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:28:16,826 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:28:16,826 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 10:28:16,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:28:16,826 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:28:16,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 10:28:16,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:28:16 BoogieIcfgContainer [2018-11-10 10:28:16,831 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 10:28:16,832 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:28:16,832 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:28:16,832 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:28:16,832 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:28:10" (3/4) ... [2018-11-10 10:28:16,835 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 10:28:16,835 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:28:16,835 INFO L168 Benchmark]: Toolchain (without parser) took 6794.62 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.1 MB). Free memory was 957.6 MB in the beginning and 1.0 GB in the end (delta: -87.3 MB). Peak memory consumption was 237.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:28:16,836 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:28:16,836 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.03 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:28:16,837 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -198.9 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:28:16,837 INFO L168 Benchmark]: Boogie Preprocessor took 15.01 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 10:28:16,837 INFO L168 Benchmark]: RCFGBuilder took 225.29 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: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:28:16,838 INFO L168 Benchmark]: BuchiAutomizer took 6169.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.7 MB). Peak memory consumption was 245.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:28:16,838 INFO L168 Benchmark]: Witness Printer took 3.30 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:28:16,840 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.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 306.03 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 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 72.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -198.9 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.01 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 225.29 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: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6169.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.7 MB). Peak memory consumption was 245.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.30 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (5 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 9 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 12 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 10 iterations. TraceHistogramMax:3. Analysis of lassos took 4.6s. Construction of modules took 0.3s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 144 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 250 states and ocurred in iteration 8. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 15/15 HoareTripleCheckerStatistics: 225 SDtfs, 268 SDslu, 462 SDs, 0 SdLazy, 591 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital193 mio100 ax109 hnf100 lsp87 ukn86 mio100 lsp33 div100 bol100 ite100 ukn100 eq182 hnf88 smp92 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...