./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_39745403-8c8b-48e5-a4d7-873ca77cd5ab/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_39745403-8c8b-48e5-a4d7-873ca77cd5ab/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_39745403-8c8b-48e5-a4d7-873ca77cd5ab/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_39745403-8c8b-48e5-a4d7-873ca77cd5ab/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_39745403-8c8b-48e5-a4d7-873ca77cd5ab/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_39745403-8c8b-48e5-a4d7-873ca77cd5ab/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 6d6fa40570ac98fcded670ccb8a913ea07efa9b1 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:21:24,576 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:21:24,577 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:21:24,584 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:21:24,584 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:21:24,585 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:21:24,586 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:21:24,587 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:21:24,588 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:21:24,588 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:21:24,589 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:21:24,590 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:21:24,590 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:21:24,591 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:21:24,592 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:21:24,592 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:21:24,593 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:21:24,594 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:21:24,596 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:21:24,597 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:21:24,598 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:21:24,599 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:21:24,600 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:21:24,600 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:21:24,601 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:21:24,602 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:21:24,603 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:21:24,603 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:21:24,604 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:21:24,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:21:24,604 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:21:24,605 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:21:24,605 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:21:24,605 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:21:24,606 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:21:24,606 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:21:24,607 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_39745403-8c8b-48e5-a4d7-873ca77cd5ab/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 16:21:24,615 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:21:24,616 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:21:24,616 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:21:24,617 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:21:24,617 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:21:24,617 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 16:21:24,617 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 16:21:24,617 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 16:21:24,618 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 16:21:24,618 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 16:21:24,618 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 16:21:24,618 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:21:24,618 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 16:21:24,618 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:21:24,619 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:21:24,619 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 16:21:24,619 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 16:21:24,619 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 16:21:24,619 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:21:24,619 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 16:21:24,619 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:21:24,620 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 16:21:24,620 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:21:24,620 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:21:24,620 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 16:21:24,620 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:21:24,620 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:21:24,621 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 16:21:24,623 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 16:21:24,624 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_39745403-8c8b-48e5-a4d7-873ca77cd5ab/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 -> 6d6fa40570ac98fcded670ccb8a913ea07efa9b1 [2018-11-18 16:21:24,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:21:24,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:21:24,654 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:21:24,654 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:21:24,655 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:21:24,655 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_39745403-8c8b-48e5-a4d7-873ca77cd5ab/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca_true-termination_true-no-overflow.c.i [2018-11-18 16:21:24,689 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_39745403-8c8b-48e5-a4d7-873ca77cd5ab/bin-2019/uautomizer/data/786067a94/d667839e769d4320a6d373f1cf14731b/FLAG769dde598 [2018-11-18 16:21:25,109 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:21:25,109 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_39745403-8c8b-48e5-a4d7-873ca77cd5ab/sv-benchmarks/c/termination-memory-alloca/b.11-alloca_true-termination_true-no-overflow.c.i [2018-11-18 16:21:25,116 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_39745403-8c8b-48e5-a4d7-873ca77cd5ab/bin-2019/uautomizer/data/786067a94/d667839e769d4320a6d373f1cf14731b/FLAG769dde598 [2018-11-18 16:21:25,124 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_39745403-8c8b-48e5-a4d7-873ca77cd5ab/bin-2019/uautomizer/data/786067a94/d667839e769d4320a6d373f1cf14731b [2018-11-18 16:21:25,126 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:21:25,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:21:25,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:21:25,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:21:25,131 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:21:25,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:21:25" (1/1) ... [2018-11-18 16:21:25,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c938308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:25, skipping insertion in model container [2018-11-18 16:21:25,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:21:25" (1/1) ... [2018-11-18 16:21:25,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:21:25,171 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:21:25,352 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:21:25,360 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:21:25,388 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:21:25,452 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:21:25,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:25 WrapperNode [2018-11-18 16:21:25,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:21:25,453 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:21:25,453 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:21:25,453 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:21:25,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:25" (1/1) ... [2018-11-18 16:21:25,468 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:25" (1/1) ... [2018-11-18 16:21:25,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:21:25,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:21:25,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:21:25,483 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:21:25,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:25" (1/1) ... [2018-11-18 16:21:25,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:25" (1/1) ... [2018-11-18 16:21:25,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:25" (1/1) ... [2018-11-18 16:21:25,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:25" (1/1) ... [2018-11-18 16:21:25,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:25" (1/1) ... [2018-11-18 16:21:25,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:25" (1/1) ... [2018-11-18 16:21:25,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:25" (1/1) ... [2018-11-18 16:21:25,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:21:25,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:21:25,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:21:25,497 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:21:25,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39745403-8c8b-48e5-a4d7-873ca77cd5ab/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-18 16:21:25,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 16:21:25,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 16:21:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 16:21:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 16:21:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:21:25,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:21:25,763 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:21:25,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:21:25 BoogieIcfgContainer [2018-11-18 16:21:25,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:21:25,763 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 16:21:25,763 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 16:21:25,767 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 16:21:25,767 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:21:25,768 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 04:21:25" (1/3) ... [2018-11-18 16:21:25,769 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1839b210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:21:25, skipping insertion in model container [2018-11-18 16:21:25,769 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:21:25,769 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:25" (2/3) ... [2018-11-18 16:21:25,769 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1839b210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:21:25, skipping insertion in model container [2018-11-18 16:21:25,769 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:21:25,769 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:21:25" (3/3) ... [2018-11-18 16:21:25,771 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.11-alloca_true-termination_true-no-overflow.c.i [2018-11-18 16:21:25,820 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:21:25,821 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 16:21:25,821 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 16:21:25,821 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 16:21:25,821 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:21:25,821 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:21:25,822 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 16:21:25,822 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:21:25,822 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 16:21:25,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 16:21:25,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-18 16:21:25,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:21:25,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:21:25,859 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 16:21:25,859 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:21:25,859 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 16:21:25,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 16:21:25,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-18 16:21:25,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:21:25,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:21:25,861 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 16:21:25,861 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:21:25,868 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 5#L559-2true [2018-11-18 16:21:25,869 INFO L796 eck$LassoCheckResult]: Loop: 5#L559-2true assume true; 11#L555-1true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 13#L555-2true assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 16#L555-4true test_fun_#t~short13 := test_fun_#t~short8; 19#L555-5true assume test_fun_#t~short13; 8#L555-10true test_fun_#t~short16 := test_fun_#t~short13; 10#L555-11true assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 14#L555-13true assume !!test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~mem14;havoc test_fun_#t~short16;havoc test_fun_#t~mem11;havoc test_fun_#t~short13;havoc test_fun_#t~mem5;havoc test_fun_#t~mem15;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 7#L556true assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem19; 5#L559-2true [2018-11-18 16:21:25,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:25,874 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 16:21:25,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:25,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:25,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:25,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:25,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:25,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:25,974 INFO L82 PathProgramCache]: Analyzing trace with hash 225837617, now seen corresponding path program 1 times [2018-11-18 16:21:25,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:25,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:25,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:25,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:25,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:26,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:26,004 INFO L82 PathProgramCache]: Analyzing trace with hash 158406831, now seen corresponding path program 1 times [2018-11-18 16:21:26,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:26,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:26,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:26,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:26,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:26,225 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2018-11-18 16:21:26,475 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-11-18 16:21:26,555 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:21:26,556 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:21:26,556 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:21:26,556 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:21:26,556 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:21:26,557 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:21:26,557 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:21:26,557 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:21:26,557 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.11-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-18 16:21:26,557 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:21:26,557 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:21:26,576 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-18 16:21:26,580 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-18 16:21:26,581 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-18 16:21:26,583 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-18 16:21:26,584 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-18 16:21:26,586 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-18 16:21:26,587 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-18 16:21:26,592 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-18 16:21:26,593 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-18 16:21:26,595 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-18 16:21:26,597 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-18 16:21:26,599 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-18 16:21:26,601 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-18 16:21:26,603 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-18 16:21:26,605 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-18 16:21:26,607 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-18 16:21:26,610 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-18 16:21:26,612 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-18 16:21:26,614 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-18 16:21:26,617 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-18 16:21:26,619 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-18 16:21:26,815 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-11-18 16:21:26,876 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-18 16:21:26,886 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-18 16:21:26,894 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-18 16:21:26,895 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-18 16:21:26,897 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-18 16:21:26,898 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-18 16:21:26,899 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-18 16:21:26,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:26,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:27,203 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:21:27,206 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:21:27,208 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-18 16:21:27,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:27,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:27,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:27,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,214 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-18 16:21:27,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:27,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:27,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:27,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,217 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-18 16:21:27,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:27,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:27,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:27,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,220 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-18 16:21:27,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:27,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:27,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:27,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,223 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-18 16:21:27,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:27,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:27,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:27,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,226 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-18 16:21:27,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:27,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:27,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:27,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,229 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-18 16:21:27,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:27,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:27,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,234 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-18 16:21:27,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:27,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:27,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,239 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-18 16:21:27,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:27,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:27,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:27,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,241 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-18 16:21:27,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:27,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:27,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:27,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,244 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-18 16:21:27,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:27,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:27,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:27,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,247 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-18 16:21:27,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:27,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:27,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:27,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:27,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:27,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:27,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:27,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,252 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-18 16:21:27,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,254 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:27,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:27,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,257 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-18 16:21:27,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:27,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:27,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:27,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,259 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-18 16:21:27,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:27,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:27,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:27,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,262 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-18 16:21:27,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:27,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:27,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:27,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,264 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-18 16:21:27,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:27,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:27,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:27,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,276 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-18 16:21:27,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:27,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:27,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:27,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,278 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-18 16:21:27,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:27,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:27,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:27,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,280 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-18 16:21:27,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:27,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:27,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:27,302 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-18 16:21:27,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:27,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:27,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:27,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:27,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:27,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:27,329 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:21:27,343 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 16:21:27,343 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 16:21:27,345 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:21:27,349 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:21:27,350 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:21:27,350 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-18 16:21:27,398 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-18 16:21:27,402 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:21:27,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:27,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:21:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:27,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:21:27,510 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-18 16:21:27,523 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 16:21:27,525 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 5 states. [2018-11-18 16:21:27,663 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 5 states. Result 44 states and 59 transitions. Complement of second has 9 states. [2018-11-18 16:21:27,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 16:21:27,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 16:21:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2018-11-18 16:21:27,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 2 letters. Loop has 9 letters. [2018-11-18 16:21:27,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:27,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 11 letters. Loop has 9 letters. [2018-11-18 16:21:27,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:27,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 2 letters. Loop has 18 letters. [2018-11-18 16:21:27,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:27,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 59 transitions. [2018-11-18 16:21:27,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-18 16:21:27,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 29 states and 42 transitions. [2018-11-18 16:21:27,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-18 16:21:27,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-18 16:21:27,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 42 transitions. [2018-11-18 16:21:27,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:21:27,676 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2018-11-18 16:21:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 42 transitions. [2018-11-18 16:21:27,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-18 16:21:27,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 16:21:27,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2018-11-18 16:21:27,696 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 41 transitions. [2018-11-18 16:21:27,696 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 41 transitions. [2018-11-18 16:21:27,696 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 16:21:27,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 41 transitions. [2018-11-18 16:21:27,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-18 16:21:27,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:21:27,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:21:27,697 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 16:21:27,697 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:21:27,697 INFO L794 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 229#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 230#L559-2 assume true; 213#L555-1 [2018-11-18 16:21:27,698 INFO L796 eck$LassoCheckResult]: Loop: 213#L555-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 227#L555-2 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 231#L555-4 test_fun_#t~short13 := test_fun_#t~short8; 234#L555-5 assume test_fun_#t~short13; 216#L555-10 test_fun_#t~short16 := test_fun_#t~short13; 223#L555-11 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 225#L555-13 assume !!test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~mem14;havoc test_fun_#t~short16;havoc test_fun_#t~mem11;havoc test_fun_#t~short13;havoc test_fun_#t~mem5;havoc test_fun_#t~mem15;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 218#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 219#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 212#L559-2 assume true; 213#L555-1 [2018-11-18 16:21:27,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:27,698 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-18 16:21:27,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:27,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:27,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:27,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:27,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:27,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:27,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1747639259, now seen corresponding path program 1 times [2018-11-18 16:21:27,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:27,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:27,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:27,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:27,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:27,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:27,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1905112647, now seen corresponding path program 1 times [2018-11-18 16:21:27,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:27,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:27,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:27,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:27,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:27,892 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2018-11-18 16:21:28,140 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2018-11-18 16:21:28,204 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:21:28,204 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:21:28,204 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:21:28,204 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:21:28,204 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:21:28,204 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:21:28,204 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:21:28,204 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:21:28,204 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.11-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-18 16:21:28,204 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:21:28,204 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:21:28,208 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-18 16:21:28,210 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-18 16:21:28,212 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-18 16:21:28,213 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-18 16:21:28,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:28,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:28,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:28,217 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-18 16:21:28,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:28,220 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-18 16:21:28,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:28,382 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2018-11-18 16:21:28,439 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-18 16:21:28,440 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-18 16:21:28,442 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-18 16:21:28,443 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-18 16:21:28,444 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-18 16:21:28,445 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-18 16:21:28,446 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-18 16:21:28,447 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-18 16:21:28,448 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-18 16:21:28,449 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-18 16:21:28,450 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-18 16:21:28,452 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-18 16:21:28,453 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-18 16:21:28,454 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-18 16:21:28,455 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-18 16:21:28,456 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-18 16:21:28,457 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-18 16:21:28,458 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-18 16:21:28,808 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:21:28,808 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:21:28,808 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-18 16:21:28,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:28,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:28,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:28,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:28,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:28,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:28,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:28,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:28,811 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-18 16:21:28,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:28,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:28,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:28,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:28,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:28,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:28,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:28,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:28,817 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-18 16:21:28,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:28,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:28,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:28,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:28,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:28,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:28,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:28,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:28,819 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-18 16:21:28,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:28,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:28,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:28,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:28,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:28,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:28,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:28,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:28,821 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-18 16:21:28,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:28,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:28,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:28,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:28,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:28,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:28,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:28,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:28,823 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-18 16:21:28,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:28,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:28,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:28,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:28,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:28,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:28,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:28,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:28,826 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-18 16:21:28,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:28,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:28,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:28,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:28,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:28,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:28,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:28,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:28,828 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-18 16:21:28,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:28,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:28,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:28,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:28,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:28,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:28,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:28,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:28,830 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-18 16:21:28,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:28,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:28,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:28,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:28,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:28,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:28,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:28,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:28,832 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-18 16:21:28,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:28,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:28,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:28,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:28,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:28,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:28,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:28,839 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-18 16:21:28,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:28,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:28,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:28,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:28,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:28,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:28,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:28,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-18 16:21:28,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:28,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:28,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:28,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:28,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:28,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:28,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:28,853 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-18 16:21:28,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:28,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:28,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:28,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:28,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:28,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:28,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:28,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-18 16:21:28,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:28,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:28,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:28,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:28,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:28,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:28,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:28,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-18 16:21:28,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:28,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:28,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:28,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:28,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:28,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:28,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:28,874 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-18 16:21:28,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:28,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:28,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:28,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:28,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:28,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:28,891 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:21:28,895 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-18 16:21:28,895 INFO L444 ModelExtractionUtils]: 26 out of 28 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 16:21:28,895 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:21:28,896 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:21:28,896 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:21:28,896 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2018-11-18 16:21:28,984 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-18 16:21:28,985 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:21:28,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:29,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:21:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:29,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:21:29,105 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:29,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 61 [2018-11-18 16:21:29,123 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:29,124 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 52 treesize of output 39 [2018-11-18 16:21:29,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:29,146 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:29,155 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 37 treesize of output 49 [2018-11-18 16:21:29,157 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-18 16:21:29,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 16:21:29,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:21:29,202 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2018-11-18 16:21:29,216 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-18 16:21:29,216 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-18 16:21:29,216 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 41 transitions. cyclomatic complexity: 15 Second operand 7 states. [2018-11-18 16:21:29,289 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 41 transitions. cyclomatic complexity: 15. Second operand 7 states. Result 60 states and 88 transitions. Complement of second has 10 states. [2018-11-18 16:21:29,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 16:21:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 16:21:29,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-18 16:21:29,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-18 16:21:29,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:29,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 13 letters. Loop has 10 letters. [2018-11-18 16:21:29,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:29,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 3 letters. Loop has 20 letters. [2018-11-18 16:21:29,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:29,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 88 transitions. [2018-11-18 16:21:29,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-18 16:21:29,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 88 transitions. [2018-11-18 16:21:29,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-18 16:21:29,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-18 16:21:29,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 88 transitions. [2018-11-18 16:21:29,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:21:29,295 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 88 transitions. [2018-11-18 16:21:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 88 transitions. [2018-11-18 16:21:29,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-18 16:21:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-18 16:21:29,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2018-11-18 16:21:29,300 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 85 transitions. [2018-11-18 16:21:29,300 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 85 transitions. [2018-11-18 16:21:29,300 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 16:21:29,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 85 transitions. [2018-11-18 16:21:29,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-18 16:21:29,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:21:29,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:21:29,301 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 16:21:29,301 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:21:29,302 INFO L794 eck$LassoCheckResult]: Stem: 490#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 485#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 486#L559-2 assume true; 514#L555-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 487#L555-2 [2018-11-18 16:21:29,302 INFO L796 eck$LassoCheckResult]: Loop: 487#L555-2 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 488#L555-4 test_fun_#t~short13 := test_fun_#t~short8; 491#L555-5 assume test_fun_#t~short13; 468#L555-10 test_fun_#t~short16 := test_fun_#t~short13; 475#L555-11 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 478#L555-13 assume !!test_fun_#t~short16;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~mem14;havoc test_fun_#t~short16;havoc test_fun_#t~mem11;havoc test_fun_#t~short13;havoc test_fun_#t~mem5;havoc test_fun_#t~mem15;havoc test_fun_#t~mem6;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 470#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 471#L559 assume !(test_fun_#t~mem20 == test_fun_#t~mem21);havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem23 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23; 464#L559-2 assume true; 465#L555-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 487#L555-2 [2018-11-18 16:21:29,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:29,302 INFO L82 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2018-11-18 16:21:29,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:29,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:29,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:29,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:29,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:29,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:29,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1222434655, now seen corresponding path program 1 times [2018-11-18 16:21:29,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:29,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:29,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:29,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:29,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:29,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:29,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1071048157, now seen corresponding path program 1 times [2018-11-18 16:21:29,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:29,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:29,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:29,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:29,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:29,598 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2018-11-18 16:21:29,716 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-11-18 16:21:29,921 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2018-11-18 16:21:30,183 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-18 16:21:30,184 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:21:30,185 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:21:30,185 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:21:30,185 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:21:30,185 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:21:30,185 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:21:30,185 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:21:30,185 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:21:30,185 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.11-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-18 16:21:30,185 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:21:30,185 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:21:30,191 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-18 16:21:30,194 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-18 16:21:30,196 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-18 16:21:30,198 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-18 16:21:30,199 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-18 16:21:30,205 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-18 16:21:30,207 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-18 16:21:30,208 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-18 16:21:30,210 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-18 16:21:30,211 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-18 16:21:30,213 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-18 16:21:30,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:30,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:30,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:30,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:30,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:30,220 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-18 16:21:30,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:30,567 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-11-18 16:21:30,674 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2018-11-18 16:21:30,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:30,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:30,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:30,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:30,678 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-18 16:21:30,679 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-18 16:21:30,680 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-18 16:21:30,681 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-18 16:21:30,682 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-18 16:21:30,683 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-18 16:21:31,123 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:21:31,123 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:21:31,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:31,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:31,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:31,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:31,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,128 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-18 16:21:31,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:31,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:31,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:31,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,130 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-18 16:21:31,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:31,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:31,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:31,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,131 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-18 16:21:31,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:31,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:31,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:31,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,133 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-18 16:21:31,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:31,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:31,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,139 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-18 16:21:31,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:31,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:31,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:31,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,141 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-18 16:21:31,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:31,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:31,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:31,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,142 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-18 16:21:31,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:31,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:31,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:31,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,144 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-18 16:21:31,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:31,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:31,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:31,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,146 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-18 16:21:31,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:31,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:31,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,148 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-18 16:21:31,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:31,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:31,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:31,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,155 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-18 16:21:31,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:31,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:31,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:31,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,157 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-18 16:21:31,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:31,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:31,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:31,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,158 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-18 16:21:31,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:31,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:31,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,160 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-18 16:21:31,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:31,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:31,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:31,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,164 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-18 16:21:31,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:31,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:31,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:31,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,165 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-18 16:21:31,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:31,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:31,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:31,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,167 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-18 16:21:31,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:31,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:31,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,169 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-18 16:21:31,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:31,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:31,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,174 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-18 16:21:31,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:31,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:31,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:31,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:31,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:31,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,187 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-18 16:21:31,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:31,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:31,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,189 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-18 16:21:31,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:31,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:31,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,192 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-18 16:21:31,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,192 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:21:31,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,193 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:21:31,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:31,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,196 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-18 16:21:31,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,196 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:21:31,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,197 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:21:31,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:31,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,200 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-18 16:21:31,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:31,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:31,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:31,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:31,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:31,203 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-18 16:21:31,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:31,204 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:21:31,204 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:21:31,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:31,209 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-18 16:21:31,209 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 16:21:31,261 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:21:31,285 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 16:21:31,286 INFO L444 ModelExtractionUtils]: 43 out of 56 variables were initially zero. Simplification set additionally 11 variables to zero. [2018-11-18 16:21:31,286 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:21:31,287 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-18 16:21:31,287 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:21:31,287 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 Supporting invariants [] [2018-11-18 16:21:31,342 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-18 16:21:31,343 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 16:21:31,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:31,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:21:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:31,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:21:31,412 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:31,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 61 [2018-11-18 16:21:31,426 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:31,427 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 52 treesize of output 39 [2018-11-18 16:21:31,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:21:31,447 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:21:31,455 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 37 treesize of output 49 [2018-11-18 16:21:31,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-18 16:21:31,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:21:31,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:21:31,481 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2018-11-18 16:21:31,494 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-18 16:21:31,494 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-18 16:21:31,495 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 85 transitions. cyclomatic complexity: 31 Second operand 7 states. [2018-11-18 16:21:31,577 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 85 transitions. cyclomatic complexity: 31. Second operand 7 states. Result 128 states and 198 transitions. Complement of second has 10 states. [2018-11-18 16:21:31,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 16:21:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 16:21:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2018-11-18 16:21:31,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 4 letters. Loop has 10 letters. [2018-11-18 16:21:31,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:31,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 14 letters. Loop has 10 letters. [2018-11-18 16:21:31,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:31,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 4 letters. Loop has 20 letters. [2018-11-18 16:21:31,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:31,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 198 transitions. [2018-11-18 16:21:31,581 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:21:31,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 0 states and 0 transitions. [2018-11-18 16:21:31,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 16:21:31,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 16:21:31,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 16:21:31,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:21:31,582 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:21:31,582 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:21:31,582 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:21:31,582 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 16:21:31,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:21:31,582 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:21:31,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 16:21:31,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 04:21:31 BoogieIcfgContainer [2018-11-18 16:21:31,587 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 16:21:31,587 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:21:31,587 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:21:31,587 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:21:31,588 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:21:25" (3/4) ... [2018-11-18 16:21:31,590 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 16:21:31,590 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:21:31,590 INFO L168 Benchmark]: Toolchain (without parser) took 6463.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.1 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 112.9 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:31,591 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:21:31,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:31,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.75 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:31,592 INFO L168 Benchmark]: Boogie Preprocessor took 14.36 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:31,593 INFO L168 Benchmark]: RCFGBuilder took 266.01 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: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:31,593 INFO L168 Benchmark]: BuchiAutomizer took 5823.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -65.0 MB). Peak memory consumption was 111.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:31,594 INFO L168 Benchmark]: Witness Printer took 2.66 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:21:31,596 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 324.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.75 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.36 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 266.01 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: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5823.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -65.0 MB). Peak memory consumption was 111.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.66 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 58 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 36 SDtfs, 49 SDslu, 84 SDs, 0 SdLazy, 119 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital379 mio100 ax105 hnf99 lsp84 ukn64 mio100 lsp31 div100 bol104 ite100 ukn100 eq175 hnf89 smp94 dnf181 smp82 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 83ms VariablesStem: 10 VariablesLoop: 7 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...