./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_44f0ec97-eb16-4a8d-8e41-daca35248f1e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_44f0ec97-eb16-4a8d-8e41-daca35248f1e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_44f0ec97-eb16-4a8d-8e41-daca35248f1e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_44f0ec97-eb16-4a8d-8e41-daca35248f1e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_44f0ec97-eb16-4a8d-8e41-daca35248f1e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_44f0ec97-eb16-4a8d-8e41-daca35248f1e/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 570a3560ecb7b29b974852ea58d8cc903e7c487d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:09:14,988 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:09:14,989 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:09:15,000 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:09:15,005 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:09:15,006 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:09:15,007 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:09:15,008 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:09:15,010 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:09:15,015 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:09:15,017 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:09:15,017 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:09:15,018 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:09:15,018 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:09:15,019 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:09:15,020 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:09:15,020 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:09:15,022 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:09:15,029 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:09:15,031 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:09:15,032 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:09:15,035 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:09:15,039 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:09:15,041 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:09:15,042 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:09:15,042 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:09:15,043 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:09:15,044 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:09:15,044 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:09:15,045 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:09:15,045 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:09:15,045 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:09:15,046 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:09:15,046 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:09:15,049 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:09:15,049 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:09:15,050 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_44f0ec97-eb16-4a8d-8e41-daca35248f1e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:09:15,064 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:09:15,065 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:09:15,065 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:09:15,066 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:09:15,066 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:09:15,066 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:09:15,066 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:09:15,066 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:09:15,067 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:09:15,067 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:09:15,067 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:09:15,067 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:09:15,068 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:09:15,068 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:09:15,068 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:09:15,068 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:09:15,068 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:09:15,068 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:09:15,068 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:09:15,069 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:09:15,069 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:09:15,069 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:09:15,069 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:09:15,069 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:09:15,069 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:09:15,069 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:09:15,070 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:09:15,070 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:09:15,072 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_44f0ec97-eb16-4a8d-8e41-daca35248f1e/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 -> 570a3560ecb7b29b974852ea58d8cc903e7c487d [2018-10-27 06:09:15,097 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:09:15,106 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:09:15,109 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:09:15,110 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:09:15,110 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:09:15,111 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_44f0ec97-eb16-4a8d-8e41-daca35248f1e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D_true-termination.c.i [2018-10-27 06:09:15,153 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_44f0ec97-eb16-4a8d-8e41-daca35248f1e/bin-2019/uautomizer/data/40cfb996b/32736aaba995467293d41b1c990c821c/FLAG5c3e0b73c [2018-10-27 06:09:15,490 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:09:15,490 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_44f0ec97-eb16-4a8d-8e41-daca35248f1e/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D_true-termination.c.i [2018-10-27 06:09:15,494 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_44f0ec97-eb16-4a8d-8e41-daca35248f1e/bin-2019/uautomizer/data/40cfb996b/32736aaba995467293d41b1c990c821c/FLAG5c3e0b73c [2018-10-27 06:09:15,505 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_44f0ec97-eb16-4a8d-8e41-daca35248f1e/bin-2019/uautomizer/data/40cfb996b/32736aaba995467293d41b1c990c821c [2018-10-27 06:09:15,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:09:15,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:09:15,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:09:15,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:09:15,514 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:09:15,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:09:15" (1/1) ... [2018-10-27 06:09:15,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ef3d666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:15, skipping insertion in model container [2018-10-27 06:09:15,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:09:15" (1/1) ... [2018-10-27 06:09:15,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:09:15,543 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:09:15,673 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:09:15,681 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:09:15,694 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:09:15,707 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:09:15,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:15 WrapperNode [2018-10-27 06:09:15,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:09:15,708 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:09:15,708 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:09:15,708 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:09:15,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:15" (1/1) ... [2018-10-27 06:09:15,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:15" (1/1) ... [2018-10-27 06:09:15,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:09:15,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:09:15,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:09:15,738 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:09:15,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:15" (1/1) ... [2018-10-27 06:09:15,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:15" (1/1) ... [2018-10-27 06:09:15,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:15" (1/1) ... [2018-10-27 06:09:15,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:15" (1/1) ... [2018-10-27 06:09:15,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:15" (1/1) ... [2018-10-27 06:09:15,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:15" (1/1) ... [2018-10-27 06:09:15,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:15" (1/1) ... [2018-10-27 06:09:15,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:09:15,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:09:15,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:09:15,764 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:09:15,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44f0ec97-eb16-4a8d-8e41-daca35248f1e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:09:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-10-27 06:09:15,873 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-10-27 06:09:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:09:15,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:09:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:09:16,305 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:09:16,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:16 BoogieIcfgContainer [2018-10-27 06:09:16,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:09:16,306 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:09:16,307 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:09:16,310 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:09:16,311 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:16,312 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:09:15" (1/3) ... [2018-10-27 06:09:16,312 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@799102f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:09:16, skipping insertion in model container [2018-10-27 06:09:16,313 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:16,313 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:15" (2/3) ... [2018-10-27 06:09:16,313 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@799102f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:09:16, skipping insertion in model container [2018-10-27 06:09:16,313 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:16,313 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:16" (3/3) ... [2018-10-27 06:09:16,316 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11D_true-termination.c.i [2018-10-27 06:09:16,362 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:09:16,363 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:09:16,363 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:09:16,363 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:09:16,363 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:09:16,363 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:09:16,364 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:09:16,364 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:09:16,364 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:09:16,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-10-27 06:09:16,401 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-10-27 06:09:16,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:16,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:16,409 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:09:16,409 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:16,409 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:09:16,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-10-27 06:09:16,412 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-10-27 06:09:16,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:16,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:16,413 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:09:16,413 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:16,420 INFO L793 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 26#L28true SUMMARY for call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L28 25#L28-1true havoc main_#t~nondet7; 22#L30-4true [2018-10-27 06:09:16,421 INFO L795 eck$LassoCheckResult]: Loop: 22#L30-4true assume true; 28#L30-1true SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L30-1 27#L30-2true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 13#L32true SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L32 11#L32-1true havoc main_#t~nondet10; 18#L34true SUMMARY for call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L34 15#L34-1true assume !(main_#t~mem11 < 0);havoc main_#t~mem11; 6#L38true SUMMARY for call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L38 4#L38-1true call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 24#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset; 12#L9true SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 14#L9-1true assume #t~mem1 < 0;havoc #t~mem1; 33#L10true SUMMARY for call #t~mem2 := read~int(~op.base, ~op.offset, 4); srcloc: L10 29#L10-1true ~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 32#recFINALtrue assume true; 31#recEXITtrue >#58#return; 21#L38-2true assume main_#t~ret12 == -1;main_#t~ite13 := -1; 19#L38-4true SUMMARY for call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L38-4 16#L38-5true havoc main_#t~mem14;havoc main_#t~ite13;havoc main_#t~ret12; 22#L30-4true [2018-10-27 06:09:16,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:16,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1356516, now seen corresponding path program 1 times [2018-10-27 06:09:16,431 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:16,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:16,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:16,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:16,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:16,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:16,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1121549683, now seen corresponding path program 1 times [2018-10-27 06:09:16,536 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:16,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:16,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:16,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:16,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:16,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:16,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 06:09:16,893 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:09:16,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:09:16,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:09:16,905 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 8 states. [2018-10-27 06:09:17,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:17,102 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-10-27 06:09:17,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 06:09:17,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 38 transitions. [2018-10-27 06:09:17,107 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-10-27 06:09:17,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 30 states and 33 transitions. [2018-10-27 06:09:17,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-10-27 06:09:17,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-10-27 06:09:17,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 33 transitions. [2018-10-27 06:09:17,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:09:17,118 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-10-27 06:09:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 33 transitions. [2018-10-27 06:09:17,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-27 06:09:17,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-27 06:09:17,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-10-27 06:09:17,146 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-10-27 06:09:17,146 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-10-27 06:09:17,147 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:09:17,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 33 transitions. [2018-10-27 06:09:17,148 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-10-27 06:09:17,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:17,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:17,150 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:09:17,150 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:17,150 INFO L793 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 95#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 96#L28 SUMMARY for call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L28 107#L28-1 havoc main_#t~nondet7; 102#L30-4 [2018-10-27 06:09:17,150 INFO L795 eck$LassoCheckResult]: Loop: 102#L30-4 assume true; 106#L30-1 SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L30-1 108#L30-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 100#L32 SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L32 97#L32-1 havoc main_#t~nondet10; 98#L34 SUMMARY for call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L34 103#L34-1 assume !(main_#t~mem11 < 0);havoc main_#t~mem11; 89#L38 SUMMARY for call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L38 86#L38-1 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 88#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 93#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 94#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset; 92#L15 SUMMARY for call #t~mem4 := read~int(~op.base, ~op.offset, 4); srcloc: L15 84#L15-1 SUMMARY for call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4); srcloc: L15-1 87#L15-2 havoc #t~mem4; 85#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 88#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 93#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 94#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 99#L10 SUMMARY for call #t~mem2 := read~int(~op.base, ~op.offset, 4); srcloc: L10 109#L10-1 ~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 110#recFINAL assume true; 112#recEXIT >#56#return; 90#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~ip~0.base, ~ip~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~res~0; 91#recFINAL assume true; 113#recEXIT >#58#return; 105#L38-2 assume main_#t~ret12 == -1;main_#t~ite13 := -1; 104#L38-4 SUMMARY for call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L38-4 101#L38-5 havoc main_#t~mem14;havoc main_#t~ite13;havoc main_#t~ret12; 102#L30-4 [2018-10-27 06:09:17,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:17,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1356516, now seen corresponding path program 2 times [2018-10-27 06:09:17,151 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:17,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:17,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:17,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:17,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:17,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:17,170 INFO L82 PathProgramCache]: Analyzing trace with hash 178188928, now seen corresponding path program 1 times [2018-10-27 06:09:17,170 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:17,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:17,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:17,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:17,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:17,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:17,244 INFO L82 PathProgramCache]: Analyzing trace with hash 461090429, now seen corresponding path program 1 times [2018-10-27 06:09:17,244 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:17,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:17,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:17,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:17,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:17,638 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-27 06:09:18,351 WARN L179 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 106 [2018-10-27 06:09:18,468 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-10-27 06:09:18,574 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-10-27 06:09:19,124 WARN L179 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 139 [2018-10-27 06:09:19,337 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:19,338 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:19,338 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:19,338 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:19,338 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:19,338 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:19,338 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:19,339 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:19,339 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D_true-termination.c.i_Iteration2_Lasso [2018-10-27 06:09:19,339 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:19,339 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:19,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:19,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:19,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:19,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:19,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:19,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:19,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:19,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-10-27 06:09:19,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:19,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-10-27 06:09:19,933 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:19,936 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:19,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:19,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:19,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:19,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:19,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:19,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:19,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:19,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:19,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:19,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:19,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:19,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:19,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:19,947 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:19,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:19,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:19,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:19,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:19,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:19,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:19,949 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:19,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:19,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:19,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:19,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:19,952 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:19,955 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:19,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:19,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:19,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:19,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:19,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:19,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:19,958 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:19,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:19,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:19,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:19,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,961 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:19,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:19,964 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:19,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:19,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:19,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:19,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:19,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:19,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:19,966 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:19,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:19,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:19,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:19,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:19,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:19,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:19,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:19,986 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:19,995 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:09:19,995 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:09:19,997 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:19,998 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:09:19,998 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:19,999 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2018-10-27 06:09:20,043 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-10-27 06:09:20,049 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:09:20,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:20,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:20,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:20,158 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:20,159 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:20,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 06:09:20,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:20,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:20,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-10-27 06:09:20,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-10-27 06:09:20,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:09:20,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:20,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:20,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:20,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-10-27 06:09:20,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-10-27 06:09:20,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-10-27 06:09:20,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:20,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:20,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:20,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2018-10-27 06:09:20,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 06:09:20,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 06:09:20,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:20,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:20,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:20,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-10-27 06:09:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 06:09:20,479 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2018-10-27 06:09:20,480 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 33 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-10-27 06:09:20,675 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 33 transitions. cyclomatic complexity: 5. Second operand 10 states. Result 115 states and 126 transitions. Complement of second has 19 states. [2018-10-27 06:09:20,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:20,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-27 06:09:20,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2018-10-27 06:09:20,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 4 letters. Loop has 29 letters. [2018-10-27 06:09:20,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:20,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 33 letters. Loop has 29 letters. [2018-10-27 06:09:20,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:20,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 4 letters. Loop has 58 letters. [2018-10-27 06:09:20,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:20,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 126 transitions. [2018-10-27 06:09:20,698 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-10-27 06:09:20,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 104 states and 115 transitions. [2018-10-27 06:09:20,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2018-10-27 06:09:20,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-10-27 06:09:20,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 115 transitions. [2018-10-27 06:09:20,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:20,708 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 115 transitions. [2018-10-27 06:09:20,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 115 transitions. [2018-10-27 06:09:20,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2018-10-27 06:09:20,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-27 06:09:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2018-10-27 06:09:20,714 INFO L728 BuchiCegarLoop]: Abstraction has 97 states and 106 transitions. [2018-10-27 06:09:20,714 INFO L608 BuchiCegarLoop]: Abstraction has 97 states and 106 transitions. [2018-10-27 06:09:20,716 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:09:20,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 106 transitions. [2018-10-27 06:09:20,718 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-10-27 06:09:20,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:20,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:20,718 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:20,719 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:20,719 INFO L793 eck$LassoCheckResult]: Stem: 443#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 415#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 416#L28 SUMMARY for call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L28 436#L28-1 havoc main_#t~nondet7; 437#L30-4 assume true; 433#L30-1 SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L30-1 463#L30-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 462#L32 SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L32 461#L32-1 havoc main_#t~nondet10; 428#L34 SUMMARY for call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L34 421#L34-1 assume !(main_#t~mem11 < 0);havoc main_#t~mem11; 395#L38 SUMMARY for call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L38 391#L38-1 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 392#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 475#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 473#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset; 471#L15 SUMMARY for call #t~mem4 := read~int(~op.base, ~op.offset, 4); srcloc: L15 469#L15-1 SUMMARY for call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4); srcloc: L15-1 467#L15-2 havoc #t~mem4; 385#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 397#recENTRY [2018-10-27 06:09:20,719 INFO L795 eck$LassoCheckResult]: Loop: 397#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 411#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 412#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset; 404#L15 SUMMARY for call #t~mem4 := read~int(~op.base, ~op.offset, 4); srcloc: L15 384#L15-1 SUMMARY for call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4); srcloc: L15-1 387#L15-2 havoc #t~mem4; 386#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 397#recENTRY [2018-10-27 06:09:20,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:20,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1553105020, now seen corresponding path program 1 times [2018-10-27 06:09:20,719 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:20,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:20,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:20,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:20,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:20,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:20,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1778151475, now seen corresponding path program 1 times [2018-10-27 06:09:20,755 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:20,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:20,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:20,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:20,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:20,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:20,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1600915280, now seen corresponding path program 2 times [2018-10-27 06:09:20,770 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:20,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:20,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:20,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:20,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:20,941 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2018-10-27 06:09:21,611 WARN L179 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 111 [2018-10-27 06:09:21,959 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 115 [2018-10-27 06:09:22,018 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:22,018 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:22,018 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:22,018 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:22,018 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:22,018 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:22,018 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:22,018 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:22,019 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:09:22,019 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:22,019 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:22,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:22,699 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:22,699 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:22,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,704 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,706 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,712 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,714 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,725 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,734 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:22,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:22,743 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,746 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,748 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,758 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,760 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,764 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,780 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,782 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,789 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,797 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,799 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,806 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,808 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,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-10-27 06:09:22,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,810 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,812 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:22,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:22,815 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,817 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,819 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,822 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,824 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,825 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,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-10-27 06:09:22,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,828 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,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-10-27 06:09:22,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,829 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,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-10-27 06:09:22,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,831 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,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-10-27 06:09:22,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,833 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,835 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,839 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,841 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:22,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:22,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:22,843 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:22,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:22,852 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,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-10-27 06:09:22,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,853 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:22,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,854 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:22,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:22,856 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,857 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:22,857 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:22,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,859 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-10-27 06:09:22,860 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:09:22,879 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:22,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:22,896 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:22,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:22,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:22,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:22,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:22,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:22,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:22,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:22,942 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:22,953 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:09:22,953 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:09:22,953 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:22,955 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:09:22,955 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:22,955 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2018-10-27 06:09:23,027 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-10-27 06:09:23,039 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:09:23,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:23,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:23,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:23,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2018-10-27 06:09:23,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-10-27 06:09:23,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:23,304 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:23,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43 [2018-10-27 06:09:23,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 06:09:23,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 06:09:23,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-27 06:09:23,396 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:53 [2018-10-27 06:09:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:23,416 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:09:23,416 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 106 transitions. cyclomatic complexity: 14 Second operand 7 states. [2018-10-27 06:09:23,622 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 106 transitions. cyclomatic complexity: 14. Second operand 7 states. Result 211 states and 234 transitions. Complement of second has 25 states. [2018-10-27 06:09:23,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:09:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2018-10-27 06:09:23,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 20 letters. Loop has 7 letters. [2018-10-27 06:09:23,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:23,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 27 letters. Loop has 7 letters. [2018-10-27 06:09:23,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:23,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 20 letters. Loop has 14 letters. [2018-10-27 06:09:23,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:23,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 211 states and 234 transitions. [2018-10-27 06:09:23,629 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-10-27 06:09:23,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 211 states to 179 states and 202 transitions. [2018-10-27 06:09:23,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2018-10-27 06:09:23,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-10-27 06:09:23,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 202 transitions. [2018-10-27 06:09:23,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:23,635 INFO L705 BuchiCegarLoop]: Abstraction has 179 states and 202 transitions. [2018-10-27 06:09:23,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 202 transitions. [2018-10-27 06:09:23,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 167. [2018-10-27 06:09:23,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-27 06:09:23,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 186 transitions. [2018-10-27 06:09:23,648 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 186 transitions. [2018-10-27 06:09:23,648 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 186 transitions. [2018-10-27 06:09:23,648 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:09:23,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 186 transitions. [2018-10-27 06:09:23,650 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-10-27 06:09:23,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:23,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:23,656 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:23,656 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:23,656 INFO L793 eck$LassoCheckResult]: Stem: 901#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 870#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 871#L28 SUMMARY for call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L28 891#L28-1 havoc main_#t~nondet7; 892#L30-4 assume true; 948#L30-1 SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L30-1 992#L30-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 990#L32 SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L32 989#L32-1 havoc main_#t~nondet10; 988#L34 SUMMARY for call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L34 986#L34-1 assume !(main_#t~mem11 < 0);havoc main_#t~mem11; 984#L38 SUMMARY for call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L38 917#L38-1 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 983#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 981#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 979#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset; 976#L15 SUMMARY for call #t~mem4 := read~int(~op.base, ~op.offset, 4); srcloc: L15 973#L15-1 SUMMARY for call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4); srcloc: L15-1 971#L15-2 havoc #t~mem4; 839#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 961#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 969#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 968#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 967#L10 SUMMARY for call #t~mem2 := read~int(~op.base, ~op.offset, 4); srcloc: L10 965#L10-1 ~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 962#recFINAL assume true; 952#recEXIT >#56#return; 951#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~ip~0.base, ~ip~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~res~0; 947#recFINAL assume true; 916#recEXIT >#58#return; 884#L38-2 assume !(main_#t~ret12 == -1);main_#t~ite13 := 1; 882#L38-4 [2018-10-27 06:09:23,656 INFO L795 eck$LassoCheckResult]: Loop: 882#L38-4 SUMMARY for call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L38-4 877#L38-5 havoc main_#t~mem14;havoc main_#t~ite13;havoc main_#t~ret12; 878#L30-4 assume true; 982#L30-1 SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L30-1 980#L30-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 978#L32 SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L32 975#L32-1 havoc main_#t~nondet10; 972#L34 SUMMARY for call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L34 970#L34-1 assume !(main_#t~mem11 < 0);havoc main_#t~mem11; 960#L38 SUMMARY for call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L38 842#L38-1 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 843#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 942#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 939#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset; 937#L15 SUMMARY for call #t~mem4 := read~int(~op.base, ~op.offset, 4); srcloc: L15 935#L15-1 SUMMARY for call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4); srcloc: L15-1 934#L15-2 havoc #t~mem4; 919#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 843#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 942#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 939#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 940#L10 SUMMARY for call #t~mem2 := read~int(~op.base, ~op.offset, 4); srcloc: L10 950#L10-1 ~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 946#recFINAL assume true; 945#recEXIT >#56#return; 920#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~ip~0.base, ~ip~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~res~0; 933#recFINAL assume true; 918#recEXIT >#58#return; 910#L38-2 assume main_#t~ret12 == -1;main_#t~ite13 := -1; 882#L38-4 [2018-10-27 06:09:23,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:23,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1568233538, now seen corresponding path program 1 times [2018-10-27 06:09:23,656 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:23,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:23,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:23,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:23,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:23,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:23,825 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44f0ec97-eb16-4a8d-8e41-daca35248f1e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:23,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:23,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:24,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-10-27 06:09:24,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-10-27 06:09:24,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:24,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2018-10-27 06:09:24,282 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 06:09:24,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:09:24,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 06:09:24,337 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:31 [2018-10-27 06:09:24,440 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 06:09:24,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:24,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 06:09:24,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-27 06:09:24,448 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:24,451 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:24,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:24,452 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:5 [2018-10-27 06:09:24,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:24,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:24,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2018-10-27 06:09:24,500 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:24,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:24,500 INFO L82 PathProgramCache]: Analyzing trace with hash -516415906, now seen corresponding path program 2 times [2018-10-27 06:09:24,500 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:24,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:24,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:24,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:24,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:24,837 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 103 [2018-10-27 06:09:25,350 WARN L179 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 140 [2018-10-27 06:09:25,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 06:09:25,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-10-27 06:09:25,440 INFO L87 Difference]: Start difference. First operand 167 states and 186 transitions. cyclomatic complexity: 26 Second operand 20 states. [2018-10-27 06:09:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:26,924 INFO L93 Difference]: Finished difference Result 157 states and 182 transitions. [2018-10-27 06:09:26,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 06:09:26,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 182 transitions. [2018-10-27 06:09:26,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:09:26,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 105 states and 118 transitions. [2018-10-27 06:09:26,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-10-27 06:09:26,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-10-27 06:09:26,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 118 transitions. [2018-10-27 06:09:26,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:26,932 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 118 transitions. [2018-10-27 06:09:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 118 transitions. [2018-10-27 06:09:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 92. [2018-10-27 06:09:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-27 06:09:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-10-27 06:09:26,939 INFO L728 BuchiCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-10-27 06:09:26,939 INFO L608 BuchiCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-10-27 06:09:26,939 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:09:26,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 101 transitions. [2018-10-27 06:09:26,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:09:26,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:26,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:26,943 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:26,943 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:26,943 INFO L793 eck$LassoCheckResult]: Stem: 1337#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1308#L28 SUMMARY for call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L28 1331#L28-1 havoc main_#t~nondet7; 1327#L30-4 assume true; 1328#L30-1 SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L30-1 1376#L30-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 1375#L32 SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L32 1374#L32-1 havoc main_#t~nondet10; 1373#L34 SUMMARY for call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L34 1372#L34-1 assume !(main_#t~mem11 < 0);havoc main_#t~mem11; 1371#L38 SUMMARY for call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L38 1342#L38-1 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 1370#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 1369#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 1368#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset; 1367#L15 SUMMARY for call #t~mem4 := read~int(~op.base, ~op.offset, 4); srcloc: L15 1365#L15-1 SUMMARY for call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4); srcloc: L15-1 1346#L15-2 havoc #t~mem4; 1291#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 1353#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 1366#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 1364#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 1363#L10 SUMMARY for call #t~mem2 := read~int(~op.base, ~op.offset, 4); srcloc: L10 1362#L10-1 ~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 1352#recFINAL assume true; 1345#recEXIT >#56#return; 1344#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~ip~0.base, ~ip~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~res~0; 1343#recFINAL assume true; 1341#recEXIT >#58#return; 1326#L38-2 assume main_#t~ret12 == -1;main_#t~ite13 := -1; 1325#L38-4 SUMMARY for call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L38-4 1322#L38-5 havoc main_#t~mem14;havoc main_#t~ite13;havoc main_#t~ret12; 1324#L30-4 assume true; 1334#L30-1 SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L30-1 1332#L30-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 1317#L32 SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L32 1309#L32-1 havoc main_#t~nondet10; 1310#L34 SUMMARY for call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L34 1320#L34-1 assume !(main_#t~mem11 < 0);havoc main_#t~mem11; 1297#L38 SUMMARY for call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L38 1287#L38-1 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 1294#recENTRY [2018-10-27 06:09:26,943 INFO L795 eck$LassoCheckResult]: Loop: 1294#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 1313#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 1314#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset; 1304#L15 SUMMARY for call #t~mem4 := read~int(~op.base, ~op.offset, 4); srcloc: L15 1286#L15-1 SUMMARY for call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4); srcloc: L15-1 1288#L15-2 havoc #t~mem4; 1289#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 1294#recENTRY [2018-10-27 06:09:26,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:26,943 INFO L82 PathProgramCache]: Analyzing trace with hash 2141985367, now seen corresponding path program 2 times [2018-10-27 06:09:26,943 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:26,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:26,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:26,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:26,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:26,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:26,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1778151475, now seen corresponding path program 2 times [2018-10-27 06:09:26,986 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:26,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:26,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:26,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:26,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:26,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:26,999 INFO L82 PathProgramCache]: Analyzing trace with hash -184276707, now seen corresponding path program 3 times [2018-10-27 06:09:26,999 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:26,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:27,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:27,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:27,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:27,735 WARN L179 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2018-10-27 06:09:28,178 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 106 [2018-10-27 06:09:28,340 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-10-27 06:09:30,369 WARN L179 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 268 DAG size of output: 237 [2018-10-27 06:09:30,576 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-10-27 06:09:30,794 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-10-27 06:09:30,989 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-10-27 06:09:30,992 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:30,992 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:30,992 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:30,992 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:30,992 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:30,992 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:30,992 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:30,992 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:30,992 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D_true-termination.c.i_Iteration5_Lasso [2018-10-27 06:09:30,992 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:30,992 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:30,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,555 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:31,555 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:31,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,557 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,567 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,569 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,571 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,580 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,581 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,583 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,585 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,587 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,588 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,590 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,604 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,605 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,615 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,616 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,618 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,619 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,622 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,624 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,625 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,633 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,635 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,638 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,652 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,655 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,659 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,660 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,676 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,680 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,691 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,693 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,694 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,700 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,716 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,723 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,724 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:31,724 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:31,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,725 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-10-27 06:09:31,725 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:09:31,738 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,750 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:31,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,751 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:31,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,753 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,759 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:31,761 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:09:31,761 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:09:31,761 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:31,762 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:09:31,762 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:31,762 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2018-10-27 06:09:31,858 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-10-27 06:09:31,927 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:09:32,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:32,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:32,587 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-10-27 06:09:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:32,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:32,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2018-10-27 06:09:32,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-10-27 06:09:32,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:32,710 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:32,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43 [2018-10-27 06:09:32,718 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 06:09:32,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 06:09:32,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-27 06:09:32,753 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:53 [2018-10-27 06:09:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:32,774 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-10-27 06:09:32,774 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 101 transitions. cyclomatic complexity: 13 Second operand 8 states. [2018-10-27 06:09:32,962 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 101 transitions. cyclomatic complexity: 13. Second operand 8 states. Result 116 states and 126 transitions. Complement of second has 24 states. [2018-10-27 06:09:32,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:09:32,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-10-27 06:09:32,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 42 letters. Loop has 7 letters. [2018-10-27 06:09:32,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:32,965 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:09:32,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:33,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:33,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:33,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2018-10-27 06:09:33,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-10-27 06:09:33,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:33,202 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:33,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43 [2018-10-27 06:09:33,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 06:09:33,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 06:09:33,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-27 06:09:33,245 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:53 [2018-10-27 06:09:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:33,264 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2018-10-27 06:09:33,264 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 101 transitions. cyclomatic complexity: 13 Second operand 8 states. [2018-10-27 06:09:33,396 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 101 transitions. cyclomatic complexity: 13. Second operand 8 states. Result 116 states and 126 transitions. Complement of second has 24 states. [2018-10-27 06:09:33,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:09:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-10-27 06:09:33,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 42 letters. Loop has 7 letters. [2018-10-27 06:09:33,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:33,400 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:09:33,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:33,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:33,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:33,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2018-10-27 06:09:33,551 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:33,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43 [2018-10-27 06:09:33,558 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 06:09:33,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-10-27 06:09:33,590 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:33,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 06:09:33,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-27 06:09:33,625 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:53 [2018-10-27 06:09:33,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:33,649 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-10-27 06:09:33,649 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 101 transitions. cyclomatic complexity: 13 Second operand 8 states. [2018-10-27 06:09:33,828 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 101 transitions. cyclomatic complexity: 13. Second operand 8 states. Result 151 states and 161 transitions. Complement of second has 25 states. [2018-10-27 06:09:33,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:33,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:09:33,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2018-10-27 06:09:33,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 42 letters. Loop has 7 letters. [2018-10-27 06:09:33,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:33,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 49 letters. Loop has 7 letters. [2018-10-27 06:09:33,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:33,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 42 letters. Loop has 14 letters. [2018-10-27 06:09:33,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:33,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 161 transitions. [2018-10-27 06:09:33,833 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:09:33,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 0 states and 0 transitions. [2018-10-27 06:09:33,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:09:33,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:09:33,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:09:33,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:09:33,834 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:09:33,834 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:09:33,834 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:09:33,834 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:09:33,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:09:33,834 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:09:33,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:09:33,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:09:33 BoogieIcfgContainer [2018-10-27 06:09:33,840 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:09:33,841 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:09:33,841 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:09:33,841 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:09:33,841 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:16" (3/4) ... [2018-10-27 06:09:33,844 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:09:33,844 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:09:33,845 INFO L168 Benchmark]: Toolchain (without parser) took 18336.58 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 257.9 MB). Free memory was 959.7 MB in the beginning and 1.1 GB in the end (delta: -115.2 MB). Peak memory consumption was 142.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:33,846 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:09:33,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.68 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 948.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:33,847 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.13 ms. Allocated memory is still 1.0 GB. Free memory was 948.9 MB in the beginning and 946.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:33,847 INFO L168 Benchmark]: Boogie Preprocessor took 25.12 ms. Allocated memory is still 1.0 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:09:33,847 INFO L168 Benchmark]: RCFGBuilder took 542.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:33,848 INFO L168 Benchmark]: BuchiAutomizer took 17533.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 102.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.9 MB). Peak memory consumption was 163.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:33,848 INFO L168 Benchmark]: Witness Printer took 3.84 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-10-27 06:09:33,850 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.16 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 197.68 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 948.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.13 ms. Allocated memory is still 1.0 GB. Free memory was 948.9 MB in the beginning and 946.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.12 ms. Allocated memory is still 1.0 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 542.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17533.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 102.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.9 MB). Peak memory consumption was 163.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.84 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 9 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 7 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.4s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 12.4s. Construction of modules took 1.8s. Büchi inclusion checks took 2.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 32 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 167 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 5/5 HoareTripleCheckerStatistics: 162 SDtfs, 193 SDslu, 465 SDs, 0 SdLazy, 551 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital360 mio100 ax100 hnf100 lsp98 ukn43 mio100 lsp35 div100 bol100 ite100 ukn100 eq182 hnf89 smp91 dnf103 smp100 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 1 VariablesLoop: 1 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...