./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.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_3f0c6ad0-9c70-44f5-889b-b18c06063370/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3f0c6ad0-9c70-44f5-889b-b18c06063370/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3f0c6ad0-9c70-44f5-889b-b18c06063370/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3f0c6ad0-9c70-44f5-889b-b18c06063370/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3f0c6ad0-9c70-44f5-889b-b18c06063370/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3f0c6ad0-9c70-44f5-889b-b18c06063370/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 4ab4fc7901859c456c176827e7d5fcf9e4988b17 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-09 22:38:49,564 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 22:38:49,566 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 22:38:49,573 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 22:38:49,573 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 22:38:49,574 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 22:38:49,575 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 22:38:49,576 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 22:38:49,577 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 22:38:49,578 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 22:38:49,579 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 22:38:49,579 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 22:38:49,579 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 22:38:49,580 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 22:38:49,581 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 22:38:49,581 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 22:38:49,582 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 22:38:49,584 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 22:38:49,585 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 22:38:49,586 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 22:38:49,587 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 22:38:49,588 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 22:38:49,590 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 22:38:49,590 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 22:38:49,590 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 22:38:49,591 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 22:38:49,591 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 22:38:49,592 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 22:38:49,593 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 22:38:49,593 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 22:38:49,594 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 22:38:49,594 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 22:38:49,594 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 22:38:49,595 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 22:38:49,595 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 22:38:49,596 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 22:38:49,596 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3f0c6ad0-9c70-44f5-889b-b18c06063370/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-09 22:38:49,616 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 22:38:49,616 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 22:38:49,617 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 22:38:49,617 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 22:38:49,617 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 22:38:49,617 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-09 22:38:49,618 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-09 22:38:49,618 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-09 22:38:49,618 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-09 22:38:49,618 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-09 22:38:49,618 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-09 22:38:49,618 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 22:38:49,618 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-09 22:38:49,618 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 22:38:49,619 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 22:38:49,619 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-09 22:38:49,619 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-09 22:38:49,619 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-09 22:38:49,619 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-09 22:38:49,619 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-09 22:38:49,619 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-09 22:38:49,619 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 22:38:49,620 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 22:38:49,620 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-09 22:38:49,620 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 22:38:49,620 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 22:38:49,620 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-09 22:38:49,622 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-09 22:38:49,622 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_3f0c6ad0-9c70-44f5-889b-b18c06063370/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 -> 4ab4fc7901859c456c176827e7d5fcf9e4988b17 [2018-11-09 22:38:49,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 22:38:49,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 22:38:49,654 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 22:38:49,655 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 22:38:49,655 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 22:38:49,656 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3f0c6ad0-9c70-44f5-889b-b18c06063370/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2018-11-09 22:38:49,692 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f0c6ad0-9c70-44f5-889b-b18c06063370/bin-2019/uautomizer/data/38aff0c9b/e5c1052a89ab4c0c9cb9da8f2c6eefb7/FLAG99fa26383 [2018-11-09 22:38:50,146 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 22:38:50,146 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3f0c6ad0-9c70-44f5-889b-b18c06063370/sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2018-11-09 22:38:50,156 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f0c6ad0-9c70-44f5-889b-b18c06063370/bin-2019/uautomizer/data/38aff0c9b/e5c1052a89ab4c0c9cb9da8f2c6eefb7/FLAG99fa26383 [2018-11-09 22:38:50,167 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3f0c6ad0-9c70-44f5-889b-b18c06063370/bin-2019/uautomizer/data/38aff0c9b/e5c1052a89ab4c0c9cb9da8f2c6eefb7 [2018-11-09 22:38:50,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 22:38:50,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-09 22:38:50,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 22:38:50,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 22:38:50,175 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 22:38:50,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:38:50" (1/1) ... [2018-11-09 22:38:50,178 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 09.11 10:38:50, skipping insertion in model container [2018-11-09 22:38:50,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:38:50" (1/1) ... [2018-11-09 22:38:50,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 22:38:50,215 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 22:38:50,412 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:38:50,421 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 22:38:50,442 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:38:50,473 INFO L193 MainTranslator]: Completed translation [2018-11-09 22:38:50,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:38:50 WrapperNode [2018-11-09 22:38:50,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 22:38:50,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-09 22:38:50,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-09 22:38:50,474 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-09 22:38:50,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:38:50" (1/1) ... [2018-11-09 22:38:50,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:38:50" (1/1) ... [2018-11-09 22:38:50,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-09 22:38:50,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 22:38:50,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 22:38:50,545 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 22:38:50,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:38:50" (1/1) ... [2018-11-09 22:38:50,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:38:50" (1/1) ... [2018-11-09 22:38:50,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:38:50" (1/1) ... [2018-11-09 22:38:50,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:38:50" (1/1) ... [2018-11-09 22:38:50,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:38:50" (1/1) ... [2018-11-09 22:38:50,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:38:50" (1/1) ... [2018-11-09 22:38:50,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:38:50" (1/1) ... [2018-11-09 22:38:50,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 22:38:50,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 22:38:50,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 22:38:50,561 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 22:38:50,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:38:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f0c6ad0-9c70-44f5-889b-b18c06063370/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-09 22:38:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-09 22:38:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-09 22:38:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 22:38:50,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 22:38:50,819 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 22:38:50,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:38:50 BoogieIcfgContainer [2018-11-09 22:38:50,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 22:38:50,820 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-09 22:38:50,820 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-09 22:38:50,822 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-09 22:38:50,823 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:38:50,823 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 10:38:50" (1/3) ... [2018-11-09 22:38:50,824 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e8242c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 10:38:50, skipping insertion in model container [2018-11-09 22:38:50,824 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:38:50,824 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:38:50" (2/3) ... [2018-11-09 22:38:50,824 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e8242c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 10:38:50, skipping insertion in model container [2018-11-09 22:38:50,824 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:38:50,824 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:38:50" (3/3) ... [2018-11-09 22:38:50,826 INFO L375 chiAutomizerObserver]: Analyzing ICFG Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2018-11-09 22:38:50,862 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 22:38:50,862 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-09 22:38:50,862 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-09 22:38:50,862 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-09 22:38:50,863 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 22:38:50,863 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 22:38:50,863 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-09 22:38:50,863 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 22:38:50,863 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-09 22:38:50,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states. [2018-11-09 22:38:50,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-11-09 22:38:50,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:38:50,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:38:50,895 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:38:50,896 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:38:50,896 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-09 22:38:50,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states. [2018-11-09 22:38:50,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-11-09 22:38:50,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:38:50,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:38:50,899 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:38:50,899 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:38:50,904 INFO L793 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 37#L551true SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 41#L551-1true havoc main_#t~nondet5; 13#L552true SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 15#L552-1true havoc main_#t~nondet6; 31#L553true SUMMARY for call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4); srcloc: L553 35#L553-1true havoc main_#t~nondet7; 38#L555-4true [2018-11-09 22:38:50,905 INFO L795 eck$LassoCheckResult]: Loop: 38#L555-4true assume true; 12#L554-1true SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554-1 14#L554-2true main_#t~short10 := main_#t~mem8 > 0; 16#L554-3true assume !main_#t~short10; 3#L554-7true main_#t~short12 := main_#t~short10; 5#L554-8true assume !main_#t~short12; 33#L554-12true assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem11; 8#L555true SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 10#L555-1true SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555-1 32#L555-2true assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14; 42#L560true SUMMARY for call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L560 44#L560-1true SUMMARY for call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L560-1 23#L560-2true havoc main_#t~mem18; 18#L561true SUMMARY for call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4); srcloc: L561 21#L561-1true havoc main_#t~nondet19; 36#L562true SUMMARY for call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L562 40#L562-1true SUMMARY for call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L562-1 43#L562-2true havoc main_#t~mem20; 38#L555-4true [2018-11-09 22:38:50,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:38:50,909 INFO L82 PathProgramCache]: Analyzing trace with hash 57289382, now seen corresponding path program 1 times [2018-11-09 22:38:50,910 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:38:50,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:38:50,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:50,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:38:50,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:38:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:38:51,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:38:51,018 INFO L82 PathProgramCache]: Analyzing trace with hash 63597379, now seen corresponding path program 1 times [2018-11-09 22:38:51,018 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:38:51,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:38:51,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:51,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:38:51,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:38:51,077 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-09 22:38:51,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:38:51,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:38:51,082 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-09 22:38:51,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:38:51,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:38:51,097 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-11-09 22:38:51,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:38:51,143 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-11-09 22:38:51,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:38:51,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 46 transitions. [2018-11-09 22:38:51,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-11-09 22:38:51,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 38 states and 40 transitions. [2018-11-09 22:38:51,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-09 22:38:51,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-09 22:38:51,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 40 transitions. [2018-11-09 22:38:51,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 22:38:51,150 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-09 22:38:51,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 40 transitions. [2018-11-09 22:38:51,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-09 22:38:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-09 22:38:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-09 22:38:51,174 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-09 22:38:51,174 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-09 22:38:51,174 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-09 22:38:51,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 40 transitions. [2018-11-09 22:38:51,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-11-09 22:38:51,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:38:51,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:38:51,176 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:38:51,176 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:38:51,176 INFO L793 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 106#L551 SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 129#L551-1 havoc main_#t~nondet5; 109#L552 SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 110#L552-1 havoc main_#t~nondet6; 112#L553 SUMMARY for call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4); srcloc: L553 126#L553-1 havoc main_#t~nondet7; 123#L555-4 [2018-11-09 22:38:51,176 INFO L795 eck$LassoCheckResult]: Loop: 123#L555-4 assume true; 107#L554-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554-1 108#L554-2 main_#t~short10 := main_#t~mem8 > 0; 111#L554-3 assume !main_#t~short10; 94#L554-7 main_#t~short12 := main_#t~short10; 95#L554-8 assume main_#t~short12; 98#L554-9 SUMMARY for call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-9 100#L554-10 main_#t~short12 := main_#t~mem11 > 0; 103#L554-12 assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem11; 101#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 102#L555-1 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555-1 104#L555-2 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14; 121#L556 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 122#L556-1 SUMMARY for call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-1 124#L556-2 havoc main_#t~mem15; 96#L557 SUMMARY for call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557 97#L557-1 havoc main_#t~nondet16; 99#L558 SUMMARY for call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558 119#L558-1 SUMMARY for call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-1 120#L558-2 havoc main_#t~mem17; 123#L555-4 [2018-11-09 22:38:51,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:38:51,177 INFO L82 PathProgramCache]: Analyzing trace with hash 57289382, now seen corresponding path program 2 times [2018-11-09 22:38:51,177 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:38:51,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:38:51,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:51,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:38:51,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:38:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:38:51,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:38:51,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1905821450, now seen corresponding path program 1 times [2018-11-09 22:38:51,205 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:38:51,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:38:51,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:51,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:38:51,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:38:51,230 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-09 22:38:51,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:38:51,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-09 22:38:51,230 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-09 22:38:51,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-09 22:38:51,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-09 22:38:51,231 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-09 22:38:51,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:38:51,287 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-09 22:38:51,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-09 22:38:51,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 41 transitions. [2018-11-09 22:38:51,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-11-09 22:38:51,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 39 transitions. [2018-11-09 22:38:51,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-09 22:38:51,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-09 22:38:51,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 39 transitions. [2018-11-09 22:38:51,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 22:38:51,291 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-09 22:38:51,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 39 transitions. [2018-11-09 22:38:51,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-09 22:38:51,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-09 22:38:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-09 22:38:51,294 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-09 22:38:51,294 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-09 22:38:51,294 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-09 22:38:51,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 39 transitions. [2018-11-09 22:38:51,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-11-09 22:38:51,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:38:51,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:38:51,296 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:38:51,296 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:38:51,296 INFO L793 eck$LassoCheckResult]: Stem: 214#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 192#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 193#L551 SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 216#L551-1 havoc main_#t~nondet5; 196#L552 SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 197#L552-1 havoc main_#t~nondet6; 199#L553 SUMMARY for call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4); srcloc: L553 212#L553-1 havoc main_#t~nondet7; 210#L555-4 [2018-11-09 22:38:51,296 INFO L795 eck$LassoCheckResult]: Loop: 210#L555-4 assume true; 194#L554-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554-1 195#L554-2 main_#t~short10 := main_#t~mem8 > 0; 198#L554-3 assume main_#t~short10; 200#L554-4 SUMMARY for call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-4 203#L554-5 main_#t~short10 := main_#t~mem9 > 0; 181#L554-7 main_#t~short12 := main_#t~short10; 182#L554-8 assume main_#t~short12; 185#L554-9 SUMMARY for call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-9 187#L554-10 main_#t~short12 := main_#t~mem11 > 0; 190#L554-12 assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem11; 188#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 189#L555-1 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555-1 191#L555-2 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14; 208#L556 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 209#L556-1 SUMMARY for call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-1 211#L556-2 havoc main_#t~mem15; 183#L557 SUMMARY for call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557 184#L557-1 havoc main_#t~nondet16; 186#L558 SUMMARY for call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558 206#L558-1 SUMMARY for call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-1 207#L558-2 havoc main_#t~mem17; 210#L555-4 [2018-11-09 22:38:51,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:38:51,296 INFO L82 PathProgramCache]: Analyzing trace with hash 57289382, now seen corresponding path program 3 times [2018-11-09 22:38:51,296 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:38:51,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:38:51,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:51,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:38:51,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:38:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:38:51,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:38:51,328 INFO L82 PathProgramCache]: Analyzing trace with hash 690298835, now seen corresponding path program 1 times [2018-11-09 22:38:51,328 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:38:51,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:38:51,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:51,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:38:51,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:38:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:38:51,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:38:51,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1445695672, now seen corresponding path program 1 times [2018-11-09 22:38:51,362 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:38:51,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:38:51,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:51,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:38:51,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:38:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:38:51,619 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 77 [2018-11-09 22:38:51,868 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 88 [2018-11-09 22:38:51,948 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 22:38:51,948 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 22:38:51,948 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 22:38:51,949 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 22:38:51,949 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 22:38:51,949 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 22:38:51,949 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 22:38:51,949 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 22:38:51,949 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-09 22:38:51,949 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 22:38:51,949 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 22:38:51,966 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-09 22:38:51,969 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-09 22:38:51,970 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-09 22:38:51,971 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-09 22:38:51,973 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-09 22:38:51,974 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-09 22:38:51,976 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-09 22:38:51,977 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-09 22:38:51,979 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-09 22:38:51,980 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-09 22:38:51,981 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-09 22:38:51,984 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-09 22:38:51,986 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-09 22:38:51,989 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-09 22:38:51,991 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-09 22:38:51,992 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-09 22:38:51,994 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-09 22:38:51,995 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-09 22:38:51,997 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-09 22:38:52,275 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 99 [2018-11-09 22:38:52,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-09 22:38:52,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-09 22:38:52,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-09 22:38:52,836 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 22:38:52,839 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 22:38:52,841 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-09 22:38:52,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:52,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:52,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:52,846 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,846 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-09 22:38:52,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:52,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:52,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:52,849 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,849 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-09 22:38:52,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:52,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:52,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:52,851 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,852 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-09 22:38:52,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:52,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:52,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:52,853 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,854 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-09 22:38:52,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:52,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:52,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:52,856 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,856 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-09 22:38:52,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:52,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:52,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:52,858 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,858 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-09 22:38:52,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:52,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:52,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:52,860 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,861 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-09 22:38:52,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:52,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:52,865 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,865 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-09 22:38:52,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:52,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:52,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:52,867 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,867 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-09 22:38:52,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:52,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:52,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:52,869 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,870 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-09 22:38:52,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:52,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:52,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:52,872 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,872 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-09 22:38:52,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:52,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:52,876 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,876 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-09 22:38:52,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:52,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:52,880 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,880 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-09 22:38:52,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:52,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:52,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:52,882 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,882 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-09 22:38:52,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:52,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:52,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:52,884 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,885 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-09 22:38:52,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:52,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:52,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:52,887 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,887 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-09 22:38:52,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,889 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:52,889 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:52,890 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,891 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-09 22:38:52,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:52,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:52,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:52,893 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,893 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-09 22:38:52,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:52,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:52,897 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,898 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-09 22:38:52,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:52,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:52,905 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,905 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-09 22:38:52,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:52,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:52,914 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,914 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-09 22:38:52,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:52,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:52,930 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:38:52,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:52,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:52,964 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:38:52,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:52,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:52,973 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,973 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-09 22:38:52,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,975 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 22:38:52,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,976 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 22:38:52,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:52,982 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,982 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-09 22:38:52,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,983 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 22:38:52,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,984 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 22:38:52,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:52,988 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:52,991 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-09 22:38:52,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:52,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:52,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:52,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:52,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:52,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:53,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:53,002 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-09 22:38:53,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:53,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:53,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:53,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:53,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:53,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:53,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:53,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-09 22:38:53,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:53,006 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 22:38:53,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:53,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:53,007 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 22:38:53,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:53,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:53,013 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-09 22:38:53,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:53,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:53,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:53,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:53,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:53,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:53,031 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 22:38:53,044 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-09 22:38:53,044 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-09 22:38:53,046 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 22:38:53,048 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-09 22:38:53,048 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 22:38:53,048 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 Supporting invariants [] [2018-11-09 22:38:53,131 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-09 22:38:53,138 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:38:53,139 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:38:53,139 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:38:53,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:38:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:38:53,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:38:53,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-09 22:38:53,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:38:53,218 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:38:53,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-09 22:38:53,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:38:53,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:38:53,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:38:53,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-09 22:38:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:38:53,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:38:53,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 68 [2018-11-09 22:38:53,403 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 59 treesize of output 54 [2018-11-09 22:38:53,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:38:53,438 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:38:53,439 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:38:53,442 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 47 treesize of output 58 [2018-11-09 22:38:53,443 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-09 22:38:53,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:38:53,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:38:53,478 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:73 [2018-11-09 22:38:53,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 70 [2018-11-09 22:38:53,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-11-09 22:38:53,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:38:53,617 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 2 case distinctions, treesize of input 41 treesize of output 45 [2018-11-09 22:38:53,618 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-09 22:38:53,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:38:53,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 55 [2018-11-09 22:38:53,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 45 [2018-11-09 22:38:53,752 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-09 22:38:53,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-11-09 22:38:53,783 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-09 22:38:53,809 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:38:53,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-09 22:38:53,847 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:95, output treesize:123 [2018-11-09 22:38:53,952 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:38:53,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-11-09 22:38:53,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-09 22:38:53,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:38:53,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:38:54,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 62 [2018-11-09 22:38:54,025 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 51 treesize of output 44 [2018-11-09 22:38:54,026 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 22:38:54,061 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:38:54,071 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 64 [2018-11-09 22:38:54,072 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-09 22:38:54,116 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-09 22:38:54,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 62 [2018-11-09 22:38:54,203 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 51 treesize of output 44 [2018-11-09 22:38:54,204 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-09 22:38:54,240 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:38:54,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 60 [2018-11-09 22:38:54,249 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-11-09 22:38:54,282 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-09 22:38:54,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-09 22:38:54,331 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:156, output treesize:160 [2018-11-09 22:38:54,387 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-09 22:38:54,389 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2018-11-09 22:38:54,389 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 39 transitions. cyclomatic complexity: 2 Second operand 15 states. [2018-11-09 22:38:54,603 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 39 transitions. cyclomatic complexity: 2. Second operand 15 states. Result 87 states and 90 transitions. Complement of second has 26 states. [2018-11-09 22:38:54,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2018-11-09 22:38:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-09 22:38:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2018-11-09 22:38:54,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 33 transitions. Stem has 8 letters. Loop has 22 letters. [2018-11-09 22:38:54,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:38:54,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 33 transitions. Stem has 30 letters. Loop has 22 letters. [2018-11-09 22:38:54,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:38:54,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 33 transitions. Stem has 8 letters. Loop has 44 letters. [2018-11-09 22:38:54,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:38:54,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 90 transitions. [2018-11-09 22:38:54,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-11-09 22:38:54,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 78 states and 81 transitions. [2018-11-09 22:38:54,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-09 22:38:54,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2018-11-09 22:38:54,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 81 transitions. [2018-11-09 22:38:54,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 22:38:54,609 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-11-09 22:38:54,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 81 transitions. [2018-11-09 22:38:54,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2018-11-09 22:38:54,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-09 22:38:54,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-11-09 22:38:54,612 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-11-09 22:38:54,612 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-11-09 22:38:54,612 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-09 22:38:54,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 78 transitions. [2018-11-09 22:38:54,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-11-09 22:38:54,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:38:54,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:38:54,613 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:38:54,613 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:38:54,613 INFO L793 eck$LassoCheckResult]: Stem: 618#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 583#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 584#L551 SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 622#L551-1 havoc main_#t~nondet5; 591#L552 SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 592#L552-1 havoc main_#t~nondet6; 595#L553 SUMMARY for call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4); srcloc: L553 616#L553-1 havoc main_#t~nondet7; 619#L555-4 assume true; 621#L554-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554-1 635#L554-2 main_#t~short10 := main_#t~mem8 > 0; 634#L554-3 assume main_#t~short10; 633#L554-4 SUMMARY for call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-4 632#L554-5 main_#t~short10 := main_#t~mem9 > 0; 631#L554-7 main_#t~short12 := main_#t~short10; 630#L554-8 assume main_#t~short12; 629#L554-9 SUMMARY for call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-9 628#L554-10 main_#t~short12 := main_#t~mem11 > 0; 627#L554-12 assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem11; 575#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 576#L555-1 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555-1 581#L555-2 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14; 615#L560 [2018-11-09 22:38:54,613 INFO L795 eck$LassoCheckResult]: Loop: 615#L560 SUMMARY for call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L560 624#L560-1 SUMMARY for call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L560-1 603#L560-2 havoc main_#t~mem18; 596#L561 SUMMARY for call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4); srcloc: L561 597#L561-1 havoc main_#t~nondet19; 600#L562 SUMMARY for call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L562 620#L562-1 SUMMARY for call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L562-1 623#L562-2 havoc main_#t~mem20; 606#L555-4 assume true; 585#L554-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554-1 586#L554-2 main_#t~short10 := main_#t~mem8 > 0; 589#L554-3 assume main_#t~short10; 593#L554-4 SUMMARY for call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-4 598#L554-5 main_#t~short10 := main_#t~mem9 > 0; 561#L554-7 main_#t~short12 := main_#t~short10; 562#L554-8 assume main_#t~short12; 569#L554-9 SUMMARY for call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-9 573#L554-10 main_#t~short12 := main_#t~mem11 > 0; 579#L554-12 assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem11; 617#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 626#L555-1 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555-1 625#L555-2 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14; 615#L560 [2018-11-09 22:38:54,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:38:54,613 INFO L82 PathProgramCache]: Analyzing trace with hash -867244226, now seen corresponding path program 1 times [2018-11-09 22:38:54,613 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:38:54,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:38:54,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:54,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:38:54,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:38:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:38:54,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:38:54,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1793162205, now seen corresponding path program 1 times [2018-11-09 22:38:54,636 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:38:54,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:38:54,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:54,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:38:54,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:38:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:38:54,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:38:54,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1472898906, now seen corresponding path program 1 times [2018-11-09 22:38:54,651 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:38:54,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:38:54,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:54,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:38:54,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:38:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:38:54,860 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2018-11-09 22:38:55,161 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 115 [2018-11-09 22:38:55,249 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 22:38:55,249 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 22:38:55,250 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 22:38:55,250 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 22:38:55,250 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 22:38:55,250 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 22:38:55,250 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 22:38:55,250 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 22:38:55,250 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-09 22:38:55,250 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 22:38:55,250 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 22:38:55,253 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-09 22:38:55,257 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-09 22:38:55,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:38:55,259 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-09 22:38:55,260 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-09 22:38:55,261 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-09 22:38:55,262 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-09 22:38:55,264 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-09 22:38:55,266 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-09 22:38:55,267 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-09 22:38:55,268 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-09 22:38:55,537 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2018-11-09 22:38:55,630 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-09 22:38:55,635 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-09 22:38:55,636 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-09 22:38:55,637 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-09 22:38:55,638 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-09 22:38:55,639 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-09 22:38:55,640 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-09 22:38:55,641 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-09 22:38:55,642 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-09 22:38:55,643 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-09 22:38:55,645 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-09 22:38:55,646 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-09 22:38:55,647 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-09 22:38:56,037 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 22:38:56,037 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 22:38:56,038 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-09 22:38:56,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:56,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:56,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:56,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:56,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:56,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:56,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:56,040 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:56,040 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-09 22:38:56,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:56,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:56,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:56,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:56,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:56,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:56,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:56,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:56,042 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-09 22:38:56,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:56,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:56,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:56,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:56,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:56,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:56,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:56,044 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:56,044 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-09 22:38:56,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:56,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:56,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:56,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:56,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:56,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:56,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:56,045 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:56,045 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-09 22:38:56,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:56,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:56,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:56,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:56,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:56,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:56,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:56,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:56,047 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-09 22:38:56,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:56,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:56,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:56,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:56,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:56,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:56,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:56,048 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:56,049 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-09 22:38:56,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:56,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:56,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:56,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:56,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:56,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:56,051 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:56,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-09 22:38:56,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:56,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:56,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:56,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:56,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:56,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:56,053 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:56,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-09 22:38:56,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:56,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:38:56,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:56,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:56,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:56,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:38:56,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:38:56,055 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:56,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-09 22:38:56,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:56,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:56,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:56,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:56,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:56,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:56,058 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:56,058 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-09 22:38:56,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:56,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:56,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:56,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:56,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:56,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:56,061 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:56,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-09 22:38:56,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:56,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:56,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:56,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:56,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:56,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:56,065 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:56,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-09 22:38:56,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:56,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:56,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:56,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:56,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:56,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:56,071 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:56,071 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-09 22:38:56,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:56,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:56,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:56,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:56,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:56,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:56,086 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:56,086 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-09 22:38:56,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:56,087 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 22:38:56,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:56,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:56,088 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 22:38:56,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:56,090 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:56,090 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-09 22:38:56,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:56,091 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 22:38:56,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:56,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:56,092 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 22:38:56,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:56,094 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:38:56,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-09 22:38:56,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:38:56,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:38:56,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:38:56,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:38:56,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:38:56,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:38:56,099 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 22:38:56,102 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-09 22:38:56,103 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-09 22:38:56,103 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 22:38:56,103 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-09 22:38:56,103 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 22:38:56,103 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 Supporting invariants [] [2018-11-09 22:38:56,177 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-09 22:38:56,186 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:38:56,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:38:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:38:56,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:38:56,222 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:38:56,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-09 22:38:56,234 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:38:56,235 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:38:56,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-09 22:38:56,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-09 22:38:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:38:56,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:38:56,285 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:38:56,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-09 22:38:56,290 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 29 treesize of output 22 [2018-11-09 22:38:56,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,304 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-09 22:38:56,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2018-11-09 22:38:56,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-09 22:38:56,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:38:56,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:18 [2018-11-09 22:38:56,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-09 22:38:56,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-09 22:38:56,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:18 [2018-11-09 22:38:56,411 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-09 22:38:56,412 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-09 22:38:56,412 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 78 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-11-09 22:38:56,525 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 78 transitions. cyclomatic complexity: 5. Second operand 8 states. Result 134 states and 139 transitions. Complement of second has 14 states. [2018-11-09 22:38:56,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-09 22:38:56,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-09 22:38:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2018-11-09 22:38:56,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 61 transitions. Stem has 22 letters. Loop has 22 letters. [2018-11-09 22:38:56,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:38:56,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 61 transitions. Stem has 44 letters. Loop has 22 letters. [2018-11-09 22:38:56,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:38:56,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 61 transitions. Stem has 22 letters. Loop has 44 letters. [2018-11-09 22:38:56,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:38:56,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 139 transitions. [2018-11-09 22:38:56,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-11-09 22:38:56,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 111 transitions. [2018-11-09 22:38:56,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2018-11-09 22:38:56,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2018-11-09 22:38:56,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 111 transitions. [2018-11-09 22:38:56,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 22:38:56,530 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-09 22:38:56,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 111 transitions. [2018-11-09 22:38:56,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2018-11-09 22:38:56,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-09 22:38:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-11-09 22:38:56,534 INFO L728 BuchiCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-11-09 22:38:56,534 INFO L608 BuchiCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-11-09 22:38:56,534 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-09 22:38:56,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 104 transitions. [2018-11-09 22:38:56,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-11-09 22:38:56,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:38:56,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:38:56,535 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:38:56,535 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:38:56,535 INFO L793 eck$LassoCheckResult]: Stem: 1104#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1067#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1068#L551 SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 1108#L551-1 havoc main_#t~nondet5; 1073#L552 SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 1074#L552-1 havoc main_#t~nondet6; 1077#L553 SUMMARY for call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4); srcloc: L553 1103#L553-1 havoc main_#t~nondet7; 1105#L555-4 assume true; 1140#L554-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554-1 1138#L554-2 main_#t~short10 := main_#t~mem8 > 0; 1136#L554-3 assume main_#t~short10; 1134#L554-4 SUMMARY for call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-4 1132#L554-5 main_#t~short10 := main_#t~mem9 > 0; 1130#L554-7 main_#t~short12 := main_#t~short10; 1128#L554-8 assume main_#t~short12; 1126#L554-9 SUMMARY for call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-9 1123#L554-10 main_#t~short12 := main_#t~mem11 > 0; 1122#L554-12 assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem11; 1121#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 1120#L555-1 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555-1 1118#L555-2 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14; 1111#L560 SUMMARY for call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L560 1112#L560-1 SUMMARY for call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L560-1 1089#L560-2 havoc main_#t~mem18; 1082#L561 SUMMARY for call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4); srcloc: L561 1083#L561-1 havoc main_#t~nondet19; 1087#L562 SUMMARY for call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L562 1107#L562-1 SUMMARY for call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L562-1 1110#L562-2 havoc main_#t~mem20; 1114#L555-4 assume true; 1143#L554-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554-1 1142#L554-2 main_#t~short10 := main_#t~mem8 > 0; 1141#L554-3 assume main_#t~short10; 1139#L554-4 SUMMARY for call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-4 1137#L554-5 main_#t~short10 := main_#t~mem9 > 0; 1135#L554-7 main_#t~short12 := main_#t~short10; 1133#L554-8 assume main_#t~short12; 1131#L554-9 SUMMARY for call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-9 1129#L554-10 main_#t~short12 := main_#t~mem11 > 0; 1127#L554-12 assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem11; 1124#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 1064#L555-1 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555-1 1065#L555-2 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14; 1094#L556 [2018-11-09 22:38:56,535 INFO L795 eck$LassoCheckResult]: Loop: 1094#L556 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 1095#L556-1 SUMMARY for call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-1 1101#L556-2 havoc main_#t~mem15; 1048#L557 SUMMARY for call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557 1049#L557-1 havoc main_#t~nondet16; 1054#L558 SUMMARY for call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558 1090#L558-1 SUMMARY for call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-1 1092#L558-2 havoc main_#t~mem17; 1098#L555-4 assume true; 1069#L554-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554-1 1070#L554-2 main_#t~short10 := main_#t~mem8 > 0; 1075#L554-3 assume main_#t~short10; 1078#L554-4 SUMMARY for call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-4 1084#L554-5 main_#t~short10 := main_#t~mem9 > 0; 1044#L554-7 main_#t~short12 := main_#t~short10; 1045#L554-8 assume main_#t~short12; 1052#L554-9 SUMMARY for call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-9 1056#L554-10 main_#t~short12 := main_#t~mem11 > 0; 1062#L554-12 assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem11; 1058#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 1059#L555-1 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555-1 1119#L555-2 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14; 1094#L556 [2018-11-09 22:38:56,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:38:56,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1472898896, now seen corresponding path program 1 times [2018-11-09 22:38:56,536 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:38:56,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:38:56,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:56,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:38:56,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:38:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:38:56,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 22:38:56,656 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f0c6ad0-9c70-44f5-889b-b18c06063370/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-09 22:38:56,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:38:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:38:56,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:38:56,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-09 22:38:56,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-09 22:38:56,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-09 22:38:56,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:38:56,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,713 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-09 22:38:56,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-09 22:38:56,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-09 22:38:56,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-09 22:38:56,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,770 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-09 22:38:56,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-11-09 22:38:56,803 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 28 treesize of output 24 [2018-11-09 22:38:56,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 15 treesize of output 11 [2018-11-09 22:38:56,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,814 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-09 22:38:56,815 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:38:56,819 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2018-11-09 22:38:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:38:56,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 22:38:56,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2018-11-09 22:38:56,853 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-09 22:38:56,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:38:56,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1880757971, now seen corresponding path program 2 times [2018-11-09 22:38:56,853 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:38:56,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:38:56,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:56,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:38:56,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:38:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:38:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:38:57,036 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2018-11-09 22:38:57,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-09 22:38:57,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-09 22:38:57,075 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. cyclomatic complexity: 7 Second operand 12 states. [2018-11-09 22:38:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:38:57,220 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-09 22:38:57,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-09 22:38:57,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 73 transitions. [2018-11-09 22:38:57,221 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 22:38:57,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 0 states and 0 transitions. [2018-11-09 22:38:57,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-09 22:38:57,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-09 22:38:57,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-09 22:38:57,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 22:38:57,222 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:38:57,222 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:38:57,222 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:38:57,222 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-09 22:38:57,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-09 22:38:57,222 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 22:38:57,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-09 22:38:57,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 10:38:57 BoogieIcfgContainer [2018-11-09 22:38:57,227 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-09 22:38:57,227 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 22:38:57,227 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 22:38:57,227 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 22:38:57,227 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:38:50" (3/4) ... [2018-11-09 22:38:57,230 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-09 22:38:57,230 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 22:38:57,230 INFO L168 Benchmark]: Toolchain (without parser) took 7059.75 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.8 MB). Free memory was 956.6 MB in the beginning and 1.0 GB in the end (delta: -78.4 MB). Peak memory consumption was 240.4 MB. Max. memory is 11.5 GB. [2018-11-09 22:38:57,231 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:38:57,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.75 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-09 22:38:57,231 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-09 22:38:57,232 INFO L168 Benchmark]: Boogie Preprocessor took 15.75 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-09 22:38:57,232 INFO L168 Benchmark]: RCFGBuilder took 258.47 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: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2018-11-09 22:38:57,232 INFO L168 Benchmark]: BuchiAutomizer took 6406.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 69.6 MB). Peak memory consumption was 251.0 MB. Max. memory is 11.5 GB. [2018-11-09 22:38:57,233 INFO L168 Benchmark]: Witness Printer took 2.93 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:38:57,235 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 301.75 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 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 71.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.75 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 258.47 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: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6406.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 69.6 MB). Peak memory consumption was 251.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.93 ms. Allocated memory is still 1.3 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 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] + unknown-#memory_int-unknown[y][y] and consists of 14 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 8 locations. 3 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 4.1s. Construction of modules took 0.2s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 100 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 162 SDtfs, 150 SDslu, 348 SDs, 0 SdLazy, 395 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital340 mio100 ax105 hnf100 lsp92 ukn72 mio100 lsp39 div100 bol100 ite100 ukn100 eq188 hnf88 smp93 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms 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...