./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C_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_2a693185-9a8c-49f2-b9d5-d47ba56e3929/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2a693185-9a8c-49f2-b9d5-d47ba56e3929/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2a693185-9a8c-49f2-b9d5-d47ba56e3929/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2a693185-9a8c-49f2-b9d5-d47ba56e3929/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2a693185-9a8c-49f2-b9d5-d47ba56e3929/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2a693185-9a8c-49f2-b9d5-d47ba56e3929/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 faaae9aa069653e753b732f00a89bd7a139fa132 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:34:00,366 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:34:00,368 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:34:00,375 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:34:00,375 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:34:00,375 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:34:00,376 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:34:00,377 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:34:00,378 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:34:00,379 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:34:00,380 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:34:00,380 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:34:00,380 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:34:00,381 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:34:00,382 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:34:00,382 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:34:00,383 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:34:00,384 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:34:00,386 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:34:00,387 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:34:00,387 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:34:00,388 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:34:00,390 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:34:00,390 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:34:00,390 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:34:00,391 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:34:00,391 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:34:00,392 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:34:00,393 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:34:00,393 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:34:00,393 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:34:00,394 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:34:00,394 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:34:00,394 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:34:00,395 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:34:00,395 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:34:00,395 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2a693185-9a8c-49f2-b9d5-d47ba56e3929/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 12:34:00,406 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:34:00,407 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:34:00,408 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:34:00,408 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:34:00,408 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:34:00,408 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:34:00,408 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:34:00,408 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:34:00,408 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:34:00,409 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:34:00,409 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:34:00,409 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:34:00,409 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:34:00,409 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:34:00,409 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:34:00,409 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:34:00,409 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:34:00,409 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:34:00,409 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:34:00,410 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:34:00,410 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:34:00,410 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:34:00,410 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:34:00,410 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:34:00,410 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:34:00,410 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:34:00,410 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:34:00,411 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:34:00,411 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_2a693185-9a8c-49f2-b9d5-d47ba56e3929/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 -> faaae9aa069653e753b732f00a89bd7a139fa132 [2018-11-10 12:34:00,436 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:34:00,445 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:34:00,448 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:34:00,449 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:34:00,449 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:34:00,450 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2a693185-9a8c-49f2-b9d5-d47ba56e3929/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C_true-termination.c.i [2018-11-10 12:34:00,492 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2a693185-9a8c-49f2-b9d5-d47ba56e3929/bin-2019/uautomizer/data/b09726752/16e786d84b70480e961f4bb1f9559939/FLAGd7e3e6ba8 [2018-11-10 12:34:00,893 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:34:00,893 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2a693185-9a8c-49f2-b9d5-d47ba56e3929/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C_true-termination.c.i [2018-11-10 12:34:00,897 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2a693185-9a8c-49f2-b9d5-d47ba56e3929/bin-2019/uautomizer/data/b09726752/16e786d84b70480e961f4bb1f9559939/FLAGd7e3e6ba8 [2018-11-10 12:34:00,907 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2a693185-9a8c-49f2-b9d5-d47ba56e3929/bin-2019/uautomizer/data/b09726752/16e786d84b70480e961f4bb1f9559939 [2018-11-10 12:34:00,910 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:34:00,911 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:34:00,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:34:00,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:34:00,915 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:34:00,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:34:00" (1/1) ... [2018-11-10 12:34:00,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11fd8f41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:00, skipping insertion in model container [2018-11-10 12:34:00,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:34:00" (1/1) ... [2018-11-10 12:34:00,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:34:00,942 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:34:01,042 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:34:01,048 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:34:01,058 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:34:01,067 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:34:01,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:01 WrapperNode [2018-11-10 12:34:01,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:34:01,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:34:01,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:34:01,068 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:34:01,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:01" (1/1) ... [2018-11-10 12:34:01,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:01" (1/1) ... [2018-11-10 12:34:01,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:34:01,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:34:01,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:34:01,092 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:34:01,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:01" (1/1) ... [2018-11-10 12:34:01,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:01" (1/1) ... [2018-11-10 12:34:01,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:01" (1/1) ... [2018-11-10 12:34:01,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:01" (1/1) ... [2018-11-10 12:34:01,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:01" (1/1) ... [2018-11-10 12:34:01,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:01" (1/1) ... [2018-11-10 12:34:01,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:01" (1/1) ... [2018-11-10 12:34:01,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:34:01,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:34:01,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:34:01,109 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:34:01,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a693185-9a8c-49f2-b9d5-d47ba56e3929/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:34:01,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:34:01,183 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-11-10 12:34:01,183 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-11-10 12:34:01,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:34:01,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:34:01,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:34:01,340 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:34:01,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:34:01 BoogieIcfgContainer [2018-11-10 12:34:01,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:34:01,341 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:34:01,341 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:34:01,343 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:34:01,344 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:34:01,344 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:34:00" (1/3) ... [2018-11-10 12:34:01,345 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54eaeec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:34:01, skipping insertion in model container [2018-11-10 12:34:01,345 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:34:01,345 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:01" (2/3) ... [2018-11-10 12:34:01,346 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54eaeec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:34:01, skipping insertion in model container [2018-11-10 12:34:01,346 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:34:01,346 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:34:01" (3/3) ... [2018-11-10 12:34:01,347 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11C_true-termination.c.i [2018-11-10 12:34:01,384 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:34:01,384 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:34:01,385 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:34:01,385 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:34:01,385 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:34:01,385 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:34:01,385 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:34:01,385 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:34:01,385 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:34:01,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-10 12:34:01,417 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-10 12:34:01,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:34:01,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:34:01,424 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 12:34:01,424 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-11-10 12:34:01,424 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:34:01,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-10 12:34:01,426 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-10 12:34:01,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:34:01,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:34:01,427 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 12:34:01,427 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-11-10 12:34:01,432 INFO L793 eck$LassoCheckResult]: Stem: 25#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; 7#L29true SUMMARY for call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L29 6#L29-1true havoc main_#t~nondet7; 4#L31-4true [2018-11-10 12:34:01,433 INFO L795 eck$LassoCheckResult]: Loop: 4#L31-4true assume true; 9#L31-1true SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L31-1 8#L31-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; 27#L33true SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L33 26#L33-1true havoc main_#t~nondet10; 32#L35true SUMMARY for call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L35 29#L35-1true assume !(main_#t~mem11 < 0);havoc main_#t~mem11; 20#L39true SUMMARY for call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L39 19#L39-1true call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 18#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset; 11#L9true SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 12#L9-1true assume #t~mem1 < 0;havoc #t~mem1; 34#L10true SUMMARY for call #t~mem2 := read~int(~op.base, ~op.offset, 4); srcloc: L10 24#L10-1true ~r~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~op.base, ~op.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~r~0; 31#recFINALtrue assume true; 28#recEXITtrue >#58#return; 17#L39-2true assume main_#t~ret12 == -1;main_#t~ite13 := -1; 33#L39-4true SUMMARY for call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L39-4 30#L39-5true havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 4#L31-4true [2018-11-10 12:34:01,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:01,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1356516, now seen corresponding path program 1 times [2018-11-10 12:34:01,438 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:34:01,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:34:01,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:01,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:01,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:01,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:01,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1121549683, now seen corresponding path program 1 times [2018-11-10 12:34:01,522 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:34:01,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:34:01,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:01,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:01,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:34:01,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:01,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 12:34:01,651 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:34:01,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:34:01,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:34:01,666 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 8 states. [2018-11-10 12:34:01,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:01,787 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-10 12:34:01,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:34:01,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 38 transitions. [2018-11-10 12:34:01,790 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-10 12:34:01,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 30 states and 33 transitions. [2018-11-10 12:34:01,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-10 12:34:01,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-10 12:34:01,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 33 transitions. [2018-11-10 12:34:01,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:34:01,799 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-10 12:34:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 33 transitions. [2018-11-10 12:34:01,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-10 12:34:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 12:34:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-10 12:34:01,821 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-10 12:34:01,822 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-10 12:34:01,822 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:34:01,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 33 transitions. [2018-11-10 12:34:01,823 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-10 12:34:01,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:34:01,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:34:01,824 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 12:34:01,824 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-11-10 12:34:01,824 INFO L793 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 94#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; 87#L29 SUMMARY for call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L29 86#L29-1 havoc main_#t~nondet7; 84#L31-4 [2018-11-10 12:34:01,825 INFO L795 eck$LassoCheckResult]: Loop: 84#L31-4 assume true; 85#L31-1 SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L31-1 88#L31-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; 89#L33 SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L33 108#L33-1 havoc main_#t~nondet10; 109#L35 SUMMARY for call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L35 112#L35-1 assume !(main_#t~mem11 < 0);havoc main_#t~mem11; 103#L39 SUMMARY for call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L39 92#L39-1 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 97#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 90#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 93#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; 96#L16 SUMMARY for call #t~mem4 := read~int(~op.base, ~op.offset, 4); srcloc: L16 104#L16-1 SUMMARY for call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4); srcloc: L16-1 98#L16-2 havoc #t~mem4; 91#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 97#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 90#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 93#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 95#L10 SUMMARY for call #t~mem2 := read~int(~op.base, ~op.offset, 4); srcloc: L10 105#L10-1 ~r~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~op.base, ~op.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~r~0; 106#recFINAL assume true; 110#recEXIT >#56#return; 101#L18-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 := ~op.base, ~op.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~res~0; 102#recFINAL assume true; 113#recEXIT >#58#return; 99#L39-2 assume main_#t~ret12 == -1;main_#t~ite13 := -1; 100#L39-4 SUMMARY for call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L39-4 111#L39-5 havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 84#L31-4 [2018-11-10 12:34:01,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:01,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1356516, now seen corresponding path program 2 times [2018-11-10 12:34:01,825 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:34:01,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:34:01,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:01,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:01,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:01,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:01,839 INFO L82 PathProgramCache]: Analyzing trace with hash 178188928, now seen corresponding path program 1 times [2018-11-10 12:34:01,839 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:34:01,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:34:01,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:01,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:34:01,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:01,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:01,896 INFO L82 PathProgramCache]: Analyzing trace with hash 461090429, now seen corresponding path program 1 times [2018-11-10 12:34:01,896 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:34:01,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:34:01,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:01,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:01,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:02,361 WARN L179 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 116 [2018-11-10 12:34:02,943 WARN L179 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 144 [2018-11-10 12:34:03,093 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:34:03,094 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:34:03,094 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:34:03,094 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:34:03,094 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:34:03,094 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:34:03,095 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:34:03,095 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:34:03,095 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C_true-termination.c.i_Iteration2_Lasso [2018-11-10 12:34:03,095 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:34:03,095 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:34:03,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:03,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:03,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:03,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:03,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:03,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:03,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:03,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:03,312 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2018-11-10 12:34:03,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:03,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-11-10 12:34:03,506 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:34:03,509 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:34:03,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:03,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:03,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:03,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:03,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:03,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:03,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:03,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:03,516 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:03,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:03,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:03,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:03,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:03,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:03,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:03,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:03,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:03,518 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:03,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:03,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:03,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:03,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:03,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:03,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:03,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:03,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:03,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:03,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:03,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:03,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:03,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:03,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:03,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:34:03,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:34:03,525 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:03,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:03,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:03,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:03,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:03,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:03,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:03,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:03,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:03,527 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:03,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:03,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:03,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:03,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:03,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:03,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:34:03,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:34:03,531 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:03,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:03,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:03,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:03,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:03,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:03,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:03,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:03,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:03,534 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:03,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:03,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:03,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:03,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:03,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:03,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:34:03,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:34:03,550 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:34:03,556 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:34:03,556 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:34:03,558 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:34:03,559 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:34:03,559 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:34:03,559 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-11-10 12:34:03,564 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-10 12:34:03,567 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:34:03,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:03,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:34:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:03,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:34:03,653 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:34:03,653 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:34:03,658 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-11-10 12:34:03,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:03,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:03,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-11-10 12:34:03,686 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-11-10 12:34:03,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:34:03,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:03,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:03,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:03,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-11-10 12:34:03,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 12:34:03,705 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-11-10 12:34:03,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:03,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:03,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:03,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:11 [2018-11-10 12:34:03,767 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-11-10 12:34:03,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:34:03,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:03,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:03,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:03,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-11-10 12:34:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 12:34:03,797 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2018-11-10 12:34:03,797 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 33 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-11-10 12:34:03,962 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 33 transitions. cyclomatic complexity: 5. Second operand 11 states. Result 115 states and 126 transitions. Complement of second has 23 states. [2018-11-10 12:34:03,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-10 12:34:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 12:34:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2018-11-10 12:34:03,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 33 transitions. Stem has 4 letters. Loop has 29 letters. [2018-11-10 12:34:03,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:34:03,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 33 transitions. Stem has 33 letters. Loop has 29 letters. [2018-11-10 12:34:03,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:34:03,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 33 transitions. Stem has 4 letters. Loop has 58 letters. [2018-11-10 12:34:03,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:34:03,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 126 transitions. [2018-11-10 12:34:03,977 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-10 12:34:03,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 104 states and 115 transitions. [2018-11-10 12:34:03,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2018-11-10 12:34:03,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-10 12:34:03,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 115 transitions. [2018-11-10 12:34:03,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:34:03,980 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 115 transitions. [2018-11-10 12:34:03,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 115 transitions. [2018-11-10 12:34:03,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2018-11-10 12:34:03,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-10 12:34:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2018-11-10 12:34:03,987 INFO L728 BuchiCegarLoop]: Abstraction has 97 states and 106 transitions. [2018-11-10 12:34:03,987 INFO L608 BuchiCegarLoop]: Abstraction has 97 states and 106 transitions. [2018-11-10 12:34:03,987 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:34:03,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 106 transitions. [2018-11-10 12:34:03,989 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-10 12:34:03,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:34:03,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:34:03,990 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-11-10 12:34:03,990 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:03,990 INFO L793 eck$LassoCheckResult]: Stem: 441#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 409#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; 401#L29 SUMMARY for call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L29 395#L29-1 havoc main_#t~nondet7; 396#L31-4 assume true; 392#L31-1 SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L31-1 397#L31-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; 398#L33 SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L33 437#L33-1 havoc main_#t~nondet10; 438#L35 SUMMARY for call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L35 446#L35-1 assume !(main_#t~mem11 < 0);havoc main_#t~mem11; 426#L39 SUMMARY for call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L39 403#L39-1 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 419#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 402#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 404#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; 410#L16 SUMMARY for call #t~mem4 := read~int(~op.base, ~op.offset, 4); srcloc: L16 432#L16-1 SUMMARY for call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4); srcloc: L16-1 487#L16-2 havoc #t~mem4; 414#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 415#recENTRY [2018-11-10 12:34:03,991 INFO L795 eck$LassoCheckResult]: Loop: 415#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 485#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 482#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; 483#L16 SUMMARY for call #t~mem4 := read~int(~op.base, ~op.offset, 4); srcloc: L16 434#L16-1 SUMMARY for call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4); srcloc: L16-1 417#L16-2 havoc #t~mem4; 413#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 415#recENTRY [2018-11-10 12:34:03,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:03,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1553105020, now seen corresponding path program 1 times [2018-11-10 12:34:03,991 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:34:03,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:34:03,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:03,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:03,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:04,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:04,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1778151475, now seen corresponding path program 1 times [2018-11-10 12:34:04,014 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:34:04,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:34:04,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:04,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:04,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:04,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:04,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1600915280, now seen corresponding path program 2 times [2018-11-10 12:34:04,028 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:34:04,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:34:04,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:04,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:04,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:04,173 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2018-11-10 12:34:04,684 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 111 [2018-11-10 12:34:04,969 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 113 [2018-11-10 12:34:05,018 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:34:05,018 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:34:05,019 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:34:05,019 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:34:05,019 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:34:05,019 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:34:05,019 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:34:05,019 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:34:05,019 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C_true-termination.c.i_Iteration3_Lasso [2018-11-10 12:34:05,019 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:34:05,019 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:34:05,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-11-10 12:34:05,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,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-11-10 12:34:05,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-11-10 12:34:05,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-11-10 12:34:05,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-11-10 12:34:05,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-11-10 12:34:05,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,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-11-10 12:34:05,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-11-10 12:34:05,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,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-11-10 12:34:05,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-11-10 12:34:05,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,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-11-10 12:34:05,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,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-11-10 12:34:05,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,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-11-10 12:34:05,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-11-10 12:34:05,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,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-11-10 12:34:05,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,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-11-10 12:34:05,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-11-10 12:34:05,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,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-11-10 12:34:05,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,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-11-10 12:34:05,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-11-10 12:34:05,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-11-10 12:34:05,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,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-11-10 12:34:05,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-11-10 12:34:05,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-11-10 12:34:05,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:05,379 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:34:05,379 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:34:05,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,381 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,384 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,386 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,387 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,389 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,391 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,393 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:34:05,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:34:05,397 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,399 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,400 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,402 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,404 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,405 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,407 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,409 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,411 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,414 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,416 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,418 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,421 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,423 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:34:05,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:34:05,427 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,436 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,438 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,440 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,442 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,444 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,445 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,447 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:05,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:05,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:05,449 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,451 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:34:05,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:34:05,457 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,458 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:34:05,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,459 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:34:05,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:34:05,461 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,461 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:34:05,461 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:34:05,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,464 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-10 12:34:05,464 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 12:34:05,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:34:05,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:34:05,474 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:05,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:05,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:05,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:05,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:05,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:05,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:34:05,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:34:05,498 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:34:05,506 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 12:34:05,506 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 12:34:05,506 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:34:05,507 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:34:05,508 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:34:05,508 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-11-10 12:34:05,534 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-10 12:34:05,537 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:34:05,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:05,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:34:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:05,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:34:05,683 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-11-10 12:34:05,687 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-11-10 12:34:05,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:05,724 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:34:05,730 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-11-10 12:34:05,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 12:34:05,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 12:34:05,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 12:34:05,778 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:53 [2018-11-10 12:34:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:34:05,798 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-11-10 12:34:05,798 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 106 transitions. cyclomatic complexity: 14 Second operand 7 states. [2018-11-10 12:34:06,005 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-11-10 12:34:06,006 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-11-10 12:34:06,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 12:34:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2018-11-10 12:34:06,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 20 letters. Loop has 7 letters. [2018-11-10 12:34:06,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:34:06,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 27 letters. Loop has 7 letters. [2018-11-10 12:34:06,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:34:06,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 20 letters. Loop has 14 letters. [2018-11-10 12:34:06,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:34:06,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 211 states and 234 transitions. [2018-11-10 12:34:06,013 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-10 12:34:06,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 211 states to 179 states and 202 transitions. [2018-11-10 12:34:06,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2018-11-10 12:34:06,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-11-10 12:34:06,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 202 transitions. [2018-11-10 12:34:06,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:34:06,018 INFO L705 BuchiCegarLoop]: Abstraction has 179 states and 202 transitions. [2018-11-10 12:34:06,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 202 transitions. [2018-11-10 12:34:06,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 167. [2018-11-10 12:34:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-10 12:34:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 186 transitions. [2018-11-10 12:34:06,029 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 186 transitions. [2018-11-10 12:34:06,029 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 186 transitions. [2018-11-10 12:34:06,029 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:34:06,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 186 transitions. [2018-11-10 12:34:06,031 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-10 12:34:06,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:34:06,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:34:06,032 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-11-10 12:34:06,032 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-11-10 12:34:06,033 INFO L793 eck$LassoCheckResult]: Stem: 904#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 861#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; 852#L29 SUMMARY for call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L29 846#L29-1 havoc main_#t~nondet7; 847#L31-4 assume true; 853#L31-1 SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L31-1 848#L31-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; 849#L33 SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L33 900#L33-1 havoc main_#t~nondet10; 901#L35 SUMMARY for call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L35 907#L35-1 assume !(main_#t~mem11 < 0);havoc main_#t~mem11; 884#L39 SUMMARY for call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L39 880#L39-1 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 881#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 982#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 980#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; 978#L16 SUMMARY for call #t~mem4 := read~int(~op.base, ~op.offset, 4); srcloc: L16 977#L16-1 SUMMARY for call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4); srcloc: L16-1 976#L16-2 havoc #t~mem4; 859#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 870#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 871#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 984#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 983#L10 SUMMARY for call #t~mem2 := read~int(~op.base, ~op.offset, 4); srcloc: L10 981#L10-1 ~r~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~op.base, ~op.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~r~0; 979#recFINAL assume true; 975#recEXIT >#56#return; 973#L18-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 := ~op.base, ~op.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~res~0; 971#recFINAL assume true; 967#recEXIT >#58#return; 876#L39-2 assume !(main_#t~ret12 == -1);main_#t~ite13 := 1; 877#L39-4 [2018-11-10 12:34:06,033 INFO L795 eck$LassoCheckResult]: Loop: 877#L39-4 SUMMARY for call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L39-4 909#L39-5 havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 910#L31-4 assume true; 962#L31-1 SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L31-1 959#L31-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; 957#L33 SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L33 930#L33-1 havoc main_#t~nondet10; 929#L35 SUMMARY for call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L35 927#L35-1 assume !(main_#t~mem11 < 0);havoc main_#t~mem11; 924#L39 SUMMARY for call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L39 918#L39-1 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 921#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; 940#L16 SUMMARY for call #t~mem4 := read~int(~op.base, ~op.offset, 4); srcloc: L16 961#L16-1 SUMMARY for call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4); srcloc: L16-1 932#L16-2 havoc #t~mem4; 919#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 921#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; 937#L10 SUMMARY for call #t~mem2 := read~int(~op.base, ~op.offset, 4); srcloc: L10 935#L10-1 ~r~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~op.base, ~op.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~r~0; 934#recFINAL assume true; 928#recEXIT >#56#return; 920#L18-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 := ~op.base, ~op.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~res~0; 923#recFINAL assume true; 917#recEXIT >#58#return; 915#L39-2 assume main_#t~ret12 == -1;main_#t~ite13 := -1; 877#L39-4 [2018-11-10 12:34:06,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:06,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1568233538, now seen corresponding path program 1 times [2018-11-10 12:34:06,033 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:34:06,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:34:06,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:06,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:34:06,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:34:06,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:34:06,197 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a693185-9a8c-49f2-b9d5-d47ba56e3929/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:34:06,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:06,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:34:06,288 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-11-10 12:34:06,290 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-11-10 12:34:06,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:06,314 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-11-10 12:34:06,328 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 12:34:06,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:34:06,359 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-11-10 12:34:06,359 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:31 [2018-11-10 12:34:06,440 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-10 12:34:06,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:06,444 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-11-10 12:34:06,446 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-11-10 12:34:06,446 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:06,447 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:06,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:06,449 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:5 [2018-11-10 12:34:06,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:34:06,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:34:06,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2018-11-10 12:34:06,491 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:34:06,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:06,491 INFO L82 PathProgramCache]: Analyzing trace with hash -516415906, now seen corresponding path program 2 times [2018-11-10 12:34:06,491 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:34:06,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:34:06,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:06,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:06,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:06,780 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 113 [2018-11-10 12:34:07,258 WARN L179 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 149 [2018-11-10 12:34:07,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 12:34:07,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-11-10 12:34:07,348 INFO L87 Difference]: Start difference. First operand 167 states and 186 transitions. cyclomatic complexity: 26 Second operand 20 states. [2018-11-10 12:34:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:08,459 INFO L93 Difference]: Finished difference Result 157 states and 182 transitions. [2018-11-10 12:34:08,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 12:34:08,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 182 transitions. [2018-11-10 12:34:08,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:34:08,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 105 states and 118 transitions. [2018-11-10 12:34:08,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-10 12:34:08,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-10 12:34:08,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 118 transitions. [2018-11-10 12:34:08,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:34:08,463 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 118 transitions. [2018-11-10 12:34:08,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 118 transitions. [2018-11-10 12:34:08,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 92. [2018-11-10 12:34:08,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-10 12:34:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-11-10 12:34:08,468 INFO L728 BuchiCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-11-10 12:34:08,468 INFO L608 BuchiCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-11-10 12:34:08,468 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:34:08,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 101 transitions. [2018-11-10 12:34:08,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:34:08,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:34:08,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:34:08,469 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-11-10 12:34:08,469 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:08,469 INFO L793 eck$LassoCheckResult]: Stem: 1337#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1304#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; 1298#L29 SUMMARY for call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L29 1297#L29-1 havoc main_#t~nondet7; 1293#L31-4 assume true; 1294#L31-1 SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L31-1 1384#L31-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; 1342#L33 SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L33 1343#L33-1 havoc main_#t~nondet10; 1350#L35 SUMMARY for call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L35 1351#L35-1 assume !(main_#t~mem11 < 0);havoc main_#t~mem11; 1379#L39 SUMMARY for call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L39 1321#L39-1 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 1320#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 1322#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;#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; 1365#L16 SUMMARY for call #t~mem4 := read~int(~op.base, ~op.offset, 4); srcloc: L16 1360#L16-1 SUMMARY for call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4); srcloc: L16-1 1361#L16-2 havoc #t~mem4; 1310#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 1358#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 1309#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 1311#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 1313#L10 SUMMARY for call #t~mem2 := read~int(~op.base, ~op.offset, 4); srcloc: L10 1335#L10-1 ~r~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~op.base, ~op.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~r~0; 1336#recFINAL assume true; 1357#recEXIT >#56#return; 1356#L18-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 := ~op.base, ~op.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~res~0; 1355#recFINAL assume true; 1354#recEXIT >#58#return; 1323#L39-2 assume main_#t~ret12 == -1;main_#t~ite13 := -1; 1324#L39-4 SUMMARY for call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L39-4 1347#L39-5 havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 1348#L31-4 assume true; 1303#L31-1 SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L31-1 1299#L31-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; 1300#L33 SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L33 1338#L33-1 havoc main_#t~nondet10; 1339#L35 SUMMARY for call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L35 1345#L35-1 assume !(main_#t~mem11 < 0);havoc main_#t~mem11; 1328#L39 SUMMARY for call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L39 1308#L39-1 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 1314#recENTRY [2018-11-10 12:34:08,469 INFO L795 eck$LassoCheckResult]: Loop: 1314#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 1305#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 1307#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; 1312#L16 SUMMARY for call #t~mem4 := read~int(~op.base, ~op.offset, 4); srcloc: L16 1331#L16-1 SUMMARY for call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4); srcloc: L16-1 1318#L16-2 havoc #t~mem4; 1306#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 1314#recENTRY [2018-11-10 12:34:08,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:08,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2141985367, now seen corresponding path program 2 times [2018-11-10 12:34:08,470 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:34:08,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:34:08,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:08,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:34:08,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:08,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:08,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1778151475, now seen corresponding path program 2 times [2018-11-10 12:34:08,499 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:34:08,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:34:08,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:08,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:34:08,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:08,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:08,510 INFO L82 PathProgramCache]: Analyzing trace with hash -184276707, now seen corresponding path program 3 times [2018-11-10 12:34:08,510 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:34:08,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:34:08,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:08,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:34:08,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:34:09,099 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 116 [2018-11-10 12:34:10,919 WARN L179 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 274 DAG size of output: 246 [2018-11-10 12:34:11,298 WARN L179 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-11-10 12:34:11,607 WARN L179 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-11-10 12:34:11,801 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-11-10 12:34:11,803 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:34:11,803 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:34:11,803 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:34:11,803 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:34:11,803 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:34:11,803 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:34:11,803 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:34:11,803 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:34:11,803 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C_true-termination.c.i_Iteration5_Lasso [2018-11-10 12:34:11,803 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:34:11,803 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:34:11,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:11,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:34:12,139 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:34:12,139 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:34:12,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,141 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,147 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,148 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,149 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,150 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,151 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,152 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:34:12,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:34:12,155 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,157 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,159 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,160 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,162 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,164 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,165 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,167 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,169 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,170 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,174 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,175 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,177 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,179 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,184 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,185 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,187 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,189 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:34:12,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:34:12,192 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,193 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,195 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,196 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,197 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,198 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,200 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,201 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,202 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,203 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,204 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:34:12,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:34:12,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:34:12,206 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:34:12,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:34:12,207 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:34:12,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:34:12,212 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:34:12,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:34:12,219 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:34:12,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:34:12,223 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,224 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:34:12,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,224 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:34:12,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:34:12,226 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,227 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:34:12,227 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:34:12,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,228 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-10 12:34:12,228 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 12:34:12,234 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,235 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:34:12,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,236 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:34:12,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:34:12,237 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:34:12,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:34:12,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:34:12,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:34:12,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:34:12,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:34:12,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:34:12,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:34:12,243 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:34:12,245 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:34:12,245 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:34:12,245 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:34:12,246 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:34:12,246 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:34:12,246 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-11-10 12:34:12,281 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-10 12:34:12,297 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:34:12,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:12,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:34:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:12,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:34:12,475 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-11-10 12:34:12,477 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-11-10 12:34:12,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:12,496 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:34:12,500 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-11-10 12:34:12,501 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 12:34:12,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 12:34:12,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 12:34:12,529 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:53 [2018-11-10 12:34:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:34:12,547 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-10 12:34:12,547 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 101 transitions. cyclomatic complexity: 13 Second operand 8 states. [2018-11-10 12:34:12,665 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-11-10 12:34:12,667 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-11-10 12:34:12,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:34:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-11-10 12:34:12,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 42 letters. Loop has 7 letters. [2018-11-10 12:34:12,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:34:12,668 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:34:12,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:12,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:34:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:12,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:34:12,759 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-11-10 12:34:12,761 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-11-10 12:34:12,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:12,780 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:34:12,785 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-11-10 12:34:12,786 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 12:34:12,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 12:34:12,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 12:34:12,813 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:53 [2018-11-10 12:34:12,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:34:12,834 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-11-10 12:34:12,834 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 101 transitions. cyclomatic complexity: 13 Second operand 8 states. [2018-11-10 12:34:12,943 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-11-10 12:34:12,944 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-11-10 12:34:12,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:34:12,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-11-10 12:34:12,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 42 letters. Loop has 7 letters. [2018-11-10 12:34:12,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:34:12,945 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:34:12,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:12,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:34:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:12,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:34:13,048 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-11-10 12:34:13,051 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:34:13,056 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-11-10 12:34:13,057 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 12:34:13,086 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-11-10 12:34:13,086 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:13,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 12:34:13,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 12:34:13,115 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:53 [2018-11-10 12:34:13,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:34:13,131 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-11-10 12:34:13,131 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 101 transitions. cyclomatic complexity: 13 Second operand 8 states. [2018-11-10 12:34:13,275 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-11-10 12:34:13,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 12:34:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:34:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2018-11-10 12:34:13,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 42 letters. Loop has 7 letters. [2018-11-10 12:34:13,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:34:13,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 49 letters. Loop has 7 letters. [2018-11-10 12:34:13,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:34:13,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 42 letters. Loop has 14 letters. [2018-11-10 12:34:13,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:34:13,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 161 transitions. [2018-11-10 12:34:13,283 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:34:13,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 0 states and 0 transitions. [2018-11-10 12:34:13,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:34:13,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:34:13,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:34:13,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:34:13,283 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:34:13,283 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:34:13,284 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:34:13,284 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 12:34:13,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:34:13,284 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:34:13,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:34:13,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:34:13 BoogieIcfgContainer [2018-11-10 12:34:13,289 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:34:13,290 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:34:13,290 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:34:13,290 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:34:13,290 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:34:01" (3/4) ... [2018-11-10 12:34:13,294 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:34:13,294 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:34:13,294 INFO L168 Benchmark]: Toolchain (without parser) took 12383.93 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 383.3 MB). Free memory was 960.3 MB in the beginning and 1.0 GB in the end (delta: -58.6 MB). Peak memory consumption was 324.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:34:13,295 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:34:13,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.07 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 948.5 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:34:13,296 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.14 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:34:13,296 INFO L168 Benchmark]: Boogie Preprocessor took 16.39 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:34:13,296 INFO L168 Benchmark]: RCFGBuilder took 232.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:34:13,297 INFO L168 Benchmark]: BuchiAutomizer took 11948.56 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 117.6 MB). Peak memory consumption was 340.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:34:13,297 INFO L168 Benchmark]: Witness Printer took 4.27 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:34:13,299 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 155.07 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 948.5 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.14 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.39 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 232.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11948.56 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 117.6 MB). Peak memory consumption was 340.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.27 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * 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 10 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 11.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 8.6s. Construction of modules took 1.3s. Büchi inclusion checks took 1.7s. 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: 3/5 HoareTripleCheckerStatistics: 152 SDtfs, 201 SDslu, 419 SDs, 0 SdLazy, 599 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital428 mio100 ax100 hnf100 lsp98 ukn39 mio100 lsp33 div100 bol100 ite100 ukn100 eq184 hnf89 smp94 dnf100 smp100 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms 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...