./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-linkedlists/ll_append_rec-alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_49464cc6-315f-403f-b213-1040e153c8cd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_49464cc6-315f-403f-b213-1040e153c8cd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_49464cc6-315f-403f-b213-1040e153c8cd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_49464cc6-315f-403f-b213-1040e153c8cd/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-linkedlists/ll_append_rec-alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_49464cc6-315f-403f-b213-1040e153c8cd/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_49464cc6-315f-403f-b213-1040e153c8cd/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 c2cebfc5c46530d75548d14ecb216f960a012bec ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:58:50,299 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:58:50,301 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:58:50,308 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:58:50,309 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:58:50,309 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:58:50,310 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:58:50,312 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:58:50,313 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:58:50,314 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:58:50,315 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:58:50,315 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:58:50,316 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:58:50,317 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:58:50,318 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:58:50,319 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:58:50,319 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:58:50,321 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:58:50,323 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:58:50,324 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:58:50,325 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:58:50,326 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:58:50,328 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:58:50,329 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:58:50,329 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:58:50,330 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:58:50,331 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:58:50,332 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:58:50,332 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:58:50,333 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:58:50,333 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:58:50,333 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:58:50,334 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:58:50,334 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:58:50,335 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:58:50,335 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:58:50,336 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_49464cc6-315f-403f-b213-1040e153c8cd/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 15:58:50,346 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:58:50,346 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:58:50,347 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:58:50,348 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:58:50,348 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:58:50,348 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 15:58:50,348 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 15:58:50,348 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 15:58:50,348 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 15:58:50,349 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 15:58:50,349 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 15:58:50,349 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:58:50,349 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:58:50,349 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:58:50,349 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:58:50,350 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 15:58:50,350 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 15:58:50,351 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 15:58:50,352 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:58:50,352 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 15:58:50,352 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:58:50,352 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 15:58:50,352 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:58:50,353 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:58:50,353 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 15:58:50,353 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:58:50,353 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:58:50,353 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 15:58:50,354 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 15:58:50,354 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_49464cc6-315f-403f-b213-1040e153c8cd/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 -> c2cebfc5c46530d75548d14ecb216f960a012bec [2018-11-23 15:58:50,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:58:50,393 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:58:50,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:58:50,398 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:58:50,398 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:58:50,399 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_49464cc6-315f-403f-b213-1040e153c8cd/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-linkedlists/ll_append_rec-alloca_false-termination.c.i [2018-11-23 15:58:50,446 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_49464cc6-315f-403f-b213-1040e153c8cd/bin-2019/uautomizer/data/6ba7e3162/fb7af290cf7349d9aecb8ebd8085aff4/FLAG84432f756 [2018-11-23 15:58:50,829 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:58:50,829 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_49464cc6-315f-403f-b213-1040e153c8cd/sv-benchmarks/c/termination-memory-linkedlists/ll_append_rec-alloca_false-termination.c.i [2018-11-23 15:58:50,838 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_49464cc6-315f-403f-b213-1040e153c8cd/bin-2019/uautomizer/data/6ba7e3162/fb7af290cf7349d9aecb8ebd8085aff4/FLAG84432f756 [2018-11-23 15:58:50,850 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_49464cc6-315f-403f-b213-1040e153c8cd/bin-2019/uautomizer/data/6ba7e3162/fb7af290cf7349d9aecb8ebd8085aff4 [2018-11-23 15:58:50,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:58:50,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:58:50,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:58:50,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:58:50,858 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:58:50,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:58:50" (1/1) ... [2018-11-23 15:58:50,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@de84d60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:50, skipping insertion in model container [2018-11-23 15:58:50,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:58:50" (1/1) ... [2018-11-23 15:58:50,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:58:50,903 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:58:51,123 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:58:51,133 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:58:51,219 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:58:51,261 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:58:51,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:51 WrapperNode [2018-11-23 15:58:51,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:58:51,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:58:51,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:58:51,263 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:58:51,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:51" (1/1) ... [2018-11-23 15:58:51,281 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:51" (1/1) ... [2018-11-23 15:58:51,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:58:51,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:58:51,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:58:51,296 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:58:51,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:51" (1/1) ... [2018-11-23 15:58:51,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:51" (1/1) ... [2018-11-23 15:58:51,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:51" (1/1) ... [2018-11-23 15:58:51,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:51" (1/1) ... [2018-11-23 15:58:51,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:51" (1/1) ... [2018-11-23 15:58:51,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:51" (1/1) ... [2018-11-23 15:58:51,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:51" (1/1) ... [2018-11-23 15:58:51,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:58:51,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:58:51,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:58:51,318 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:58:51,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49464cc6-315f-403f-b213-1040e153c8cd/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-23 15:58:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure new_ll [2018-11-23 15:58:51,369 INFO L138 BoogieDeclarations]: Found implementation of procedure new_ll [2018-11-23 15:58:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:58:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:58:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 15:58:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 15:58:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure length [2018-11-23 15:58:51,370 INFO L138 BoogieDeclarations]: Found implementation of procedure length [2018-11-23 15:58:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:58:51,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:58:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-11-23 15:58:51,370 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-11-23 15:58:51,574 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:58:51,574 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 15:58:51,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:58:51 BoogieIcfgContainer [2018-11-23 15:58:51,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:58:51,575 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 15:58:51,575 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 15:58:51,579 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 15:58:51,580 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:58:51,580 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:58:50" (1/3) ... [2018-11-23 15:58:51,581 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23f2d1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:58:51, skipping insertion in model container [2018-11-23 15:58:51,581 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:58:51,581 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:51" (2/3) ... [2018-11-23 15:58:51,582 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23f2d1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:58:51, skipping insertion in model container [2018-11-23 15:58:51,582 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:58:51,582 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:58:51" (3/3) ... [2018-11-23 15:58:51,583 INFO L375 chiAutomizerObserver]: Analyzing ICFG ll_append_rec-alloca_false-termination.c.i [2018-11-23 15:58:51,631 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:58:51,632 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 15:58:51,632 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 15:58:51,632 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 15:58:51,632 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:58:51,632 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:58:51,632 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 15:58:51,632 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:58:51,632 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 15:58:51,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-23 15:58:51,668 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 15:58:51,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:58:51,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:58:51,674 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 15:58:51,675 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:58:51,675 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 15:58:51,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-23 15:58:51,677 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 15:58:51,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:58:51,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:58:51,678 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 15:58:51,678 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:58:51,684 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 29#L571true assume !(main_~n~0 < 1); 10#L574true call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 13#new_llENTRYtrue [2018-11-23 15:58:51,685 INFO L796 eck$LassoCheckResult]: Loop: 13#new_llENTRYtrue ~n := #in~n; 31#L548true assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 19#L552true call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 13#new_llENTRYtrue [2018-11-23 15:58:51,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:58:51,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1418233, now seen corresponding path program 1 times [2018-11-23 15:58:51,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:58:51,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:58:51,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:51,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:58:51,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:58:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:58:51,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:58:51,782 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2018-11-23 15:58:51,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:58:51,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:58:51,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:51,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:58:51,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:58:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:58:51,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:58:51,810 INFO L82 PathProgramCache]: Analyzing trace with hash -699093492, now seen corresponding path program 1 times [2018-11-23 15:58:51,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:58:51,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:58:51,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:51,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:58:51,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:58:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:58:51,976 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2018-11-23 15:58:52,300 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:58:52,301 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:58:52,301 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:58:52,301 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:58:52,302 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:58:52,302 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:58:52,302 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:58:52,302 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:58:52,302 INFO L131 ssoRankerPreferences]: Filename of dumped script: ll_append_rec-alloca_false-termination.c.i_Iteration1_Lasso [2018-11-23 15:58:52,302 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:58:52,303 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:58:52,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:52,501 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:58:52,505 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:58:52,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,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-23 15:58:52,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,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-23 15:58:52,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,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-23 15:58:52,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:52,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:58:52,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:52,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:58:52,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:52,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:52,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:52,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:52,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:52,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:52,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:52,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:52,604 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 15:58:52,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:52,608 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 15:58:52,608 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:58:52,669 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:58:52,683 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 15:58:52,683 INFO L444 ModelExtractionUtils]: 7 out of 11 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 15:58:52,685 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:58:52,687 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-23 15:58:52,687 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:58:52,688 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(new_ll_#in~n) = 1*new_ll_#in~n Supporting invariants [1*new_ll_#in~n >= 0] [2018-11-23 15:58:52,706 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 15:58:52,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:58:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:58:52,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:58:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:58:52,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:58:52,801 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-23 15:58:52,812 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 15:58:52,812 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 5 states. [2018-11-23 15:58:52,909 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states.. Second operand 5 states. Result 48 states and 56 transitions. Complement of second has 13 states. [2018-11-23 15:58:52,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:58:52,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 15:58:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-23 15:58:52,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-23 15:58:52,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:58:52,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 15:58:52,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:58:52,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-23 15:58:52,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:58:52,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 56 transitions. [2018-11-23 15:58:52,918 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 15:58:52,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 32 states and 39 transitions. [2018-11-23 15:58:52,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-23 15:58:52,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-23 15:58:52,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2018-11-23 15:58:52,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:58:52,926 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-23 15:58:52,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2018-11-23 15:58:52,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 15:58:52,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 15:58:52,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 15:58:52,948 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 15:58:52,948 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 15:58:52,949 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 15:58:52,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2018-11-23 15:58:52,950 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 15:58:52,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:58:52,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:58:52,951 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:58:52,951 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:58:52,951 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 164#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 165#L571 assume !(main_~n~0 < 1); 147#L574 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 167#new_llENTRY ~n := #in~n; 172#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 146#new_llFINAL assume true; 148#new_llEXIT >#46#return; 170#L574-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset; 158#L575 call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset);< 156#appendENTRY [2018-11-23 15:58:52,951 INFO L796 eck$LassoCheckResult]: Loop: 156#appendENTRY ~x.base, ~x.offset := #in~x.base, #in~x.offset;~y.base, ~y.offset := #in~y.base, #in~y.offset; 159#L563 assume !(~x.base == 0 && ~x.offset == 0);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x.base, 4 + ~x.offset, 8); 157#L565 call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset);< 156#appendENTRY [2018-11-23 15:58:52,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:58:52,952 INFO L82 PathProgramCache]: Analyzing trace with hash -399693255, now seen corresponding path program 1 times [2018-11-23 15:58:52,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:58:52,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:58:52,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:52,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:58:52,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:58:52,991 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-23 15:58:52,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:58:52,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:58:52,993 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:58:52,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:58:52,993 INFO L82 PathProgramCache]: Analyzing trace with hash 62702, now seen corresponding path program 1 times [2018-11-23 15:58:52,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:58:52,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:58:52,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:52,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:58:52,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:58:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:58:53,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:58:53,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:58:53,209 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-23 15:58:53,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:58:53,236 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 15:58:53,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:58:53,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2018-11-23 15:58:53,238 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 15:58:53,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 31 transitions. [2018-11-23 15:58:53,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-23 15:58:53,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 15:58:53,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2018-11-23 15:58:53,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:58:53,240 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 15:58:53,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2018-11-23 15:58:53,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 15:58:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 15:58:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 15:58:53,243 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 15:58:53,243 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 15:58:53,243 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 15:58:53,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-11-23 15:58:53,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 15:58:53,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:58:53,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:58:53,245 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:58:53,245 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:58:53,246 INFO L794 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 234#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 235#L571 assume !(main_~n~0 < 1); 224#L574 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 237#new_llENTRY ~n := #in~n; 240#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 217#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 233#new_llENTRY ~n := #in~n; 241#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 216#new_llFINAL assume true; 218#new_llEXIT >#42#return; 223#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 225#new_llFINAL assume true; 242#new_llEXIT >#46#return; 239#L574-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset; 228#L575 call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset);< 226#appendENTRY [2018-11-23 15:58:53,246 INFO L796 eck$LassoCheckResult]: Loop: 226#appendENTRY ~x.base, ~x.offset := #in~x.base, #in~x.offset;~y.base, ~y.offset := #in~y.base, #in~y.offset; 229#L563 assume !(~x.base == 0 && ~x.offset == 0);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x.base, 4 + ~x.offset, 8); 227#L565 call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset);< 226#appendENTRY [2018-11-23 15:58:53,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:58:53,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1483962993, now seen corresponding path program 1 times [2018-11-23 15:58:53,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:58:53,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:58:53,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:53,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:58:53,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:58:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:58:53,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:58:53,270 INFO L82 PathProgramCache]: Analyzing trace with hash 62702, now seen corresponding path program 2 times [2018-11-23 15:58:53,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:58:53,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:58:53,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:53,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:58:53,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:58:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:58:53,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:58:53,279 INFO L82 PathProgramCache]: Analyzing trace with hash 643179646, now seen corresponding path program 1 times [2018-11-23 15:58:53,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:58:53,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:58:53,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:53,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:58:53,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:58:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:58:53,712 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 109 [2018-11-23 15:58:53,720 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:58:53,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:58:53,763 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:58:53,767 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:58:53,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 15:58:53,799 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:104 [2018-11-23 15:58:54,103 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 102 [2018-11-23 15:58:54,256 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:58:54,256 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:58:54,256 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:58:54,256 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:58:54,256 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:58:54,256 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:58:54,256 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:58:54,257 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:58:54,257 INFO L131 ssoRankerPreferences]: Filename of dumped script: ll_append_rec-alloca_false-termination.c.i_Iteration3_Lasso [2018-11-23 15:58:54,257 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:58:54,257 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:58:54,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:58:54,714 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-11-23 15:58:54,733 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:58:54,734 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:58:54,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:54,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:58:54,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:54,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:58:54,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:54,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:58:54,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,757 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:58:54,758 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 15:58:54,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,787 INFO L402 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2018-11-23 15:58:54,787 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-23 15:58:54,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:54,918 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:58:54,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:54,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:58:54,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:54,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:58:54,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:58:54,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:58:54,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,962 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 15:58:54,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,963 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:54,964 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:54,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,965 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:54,966 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:54,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,967 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:54,968 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 15:58:54,968 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 15:58:54,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,970 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:54,970 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:54,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,972 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:54,972 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:54,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:54,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,974 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:54,974 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:54,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:54,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,975 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:54,976 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 15:58:54,976 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 15:58:54,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:54,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:54,981 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:54,982 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 15:58:54,982 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 15:58:54,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:54,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:54,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:54,985 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:58:54,985 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 15:58:54,985 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,021 INFO L402 nArgumentSynthesizer]: We have 84 Motzkin's Theorem applications. [2018-11-23 15:58:55,022 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-23 15:58:55,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,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-23 15:58:55,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,202 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,203 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 15:58:55,203 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 15:58:55,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,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-23 15:58:55,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,206 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,207 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 15:58:55,207 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 15:58:55,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,212 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,213 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,215 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,215 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,217 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,218 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 15:58:55,218 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 15:58:55,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,221 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,221 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,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-23 15:58:55,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,224 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,224 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,226 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,226 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,229 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,229 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,231 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,232 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,234 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,234 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,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-23 15:58:55,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,236 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,237 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,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-23 15:58:55,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,239 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,239 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,242 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,242 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,244 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,245 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,247 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,247 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,249 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,250 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,252 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,252 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,254 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,255 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,257 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,257 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,259 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,259 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,262 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,262 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,264 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,264 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,266 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:55,267 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:55,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,268 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 15:58:55,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,269 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,269 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,272 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,272 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,274 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,275 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 15:58:55,275 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:58:55,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,278 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,278 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,280 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,280 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,282 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,282 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,284 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,382 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 15:58:55,382 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:58:55,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,386 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,387 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 15:58:55,387 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:58:55,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,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-23 15:58:55,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,390 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:58:55,390 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 15:58:55,391 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,424 INFO L402 nArgumentSynthesizer]: We have 112 Motzkin's Theorem applications. [2018-11-23 15:58:55,424 INFO L403 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2018-11-23 15:58:55,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,601 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,602 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 15:58:55,602 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:58:55,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,605 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,606 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 15:58:55,606 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:58:55,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,610 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,610 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,612 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,612 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,613 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,614 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 15:58:55,614 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:58:55,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,617 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,617 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,619 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,619 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,620 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,621 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,622 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,623 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,624 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,624 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,626 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,626 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,628 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,628 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,629 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,630 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,631 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,632 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,633 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,634 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,635 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,636 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,637 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,637 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,639 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,639 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,641 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,641 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,642 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,643 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,644 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,645 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,646 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,647 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,648 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,648 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,650 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:55,650 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:55,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,651 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 15:58:55,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,652 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,652 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,654 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,654 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,656 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,657 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 15:58:55,657 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 15:58:55,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,660 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,660 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,662 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,662 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,663 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,664 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,665 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,666 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 15:58:55,666 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 15:58:55,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,672 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,673 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 15:58:55,673 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 15:58:55,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,676 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:58:55,676 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 15:58:55,677 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,722 INFO L402 nArgumentSynthesizer]: We have 140 Motzkin's Theorem applications. [2018-11-23 15:58:55,722 INFO L403 nArgumentSynthesizer]: A total of 20 supporting invariants were added. [2018-11-23 15:58:55,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,953 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,954 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 15:58:55,955 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 15:58:55,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,958 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,959 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 15:58:55,959 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 15:58:55,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,964 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,964 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,966 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,966 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,968 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,968 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 15:58:55,968 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 15:58:55,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,971 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,971 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,973 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,974 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,975 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,976 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,977 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,977 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,979 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,979 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,981 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,981 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,983 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,983 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,985 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,985 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,987 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,987 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,989 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,989 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,991 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,991 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,993 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,993 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,995 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,995 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,997 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,997 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:55,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:55,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:55,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:55,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:55,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:55,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:55,999 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:55,999 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:55,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:56,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,000 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:56,001 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:56,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:56,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,002 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:56,003 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:56,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:56,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,004 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:56,005 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:56,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:58:56,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,007 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:56,007 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:56,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,008 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 15:58:56,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,008 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,008 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,009 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,009 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,011 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,011 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,011 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,012 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,013 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,013 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,013 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,014 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 15:58:56,014 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 15:58:56,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,018 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,018 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,018 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,018 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,020 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,020 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,020 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,021 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,022 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,022 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,023 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,023 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,024 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,024 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,025 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,025 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 15:58:56,026 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 15:58:56,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,030 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,030 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,030 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,031 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 15:58:56,031 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 15:58:56,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,036 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,036 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,036 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:58:56,036 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 15:58:56,037 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,068 INFO L402 nArgumentSynthesizer]: We have 84 Motzkin's Theorem applications. [2018-11-23 15:58:56,068 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-23 15:58:56,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,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-23 15:58:56,390 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,391 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,391 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,392 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 15:58:56,392 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 15:58:56,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,396 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,396 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,396 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,397 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 15:58:56,397 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 15:58:56,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,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-23 15:58:56,402 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,402 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,403 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,403 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,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-23 15:58:56,405 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,405 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,406 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,406 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,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-23 15:58:56,408 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,408 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,408 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,409 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 15:58:56,409 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 15:58:56,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,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-23 15:58:56,412 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,412 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,413 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,413 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,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-23 15:58:56,415 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,415 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,415 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,416 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,417 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,417 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,418 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,418 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,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-23 15:58:56,420 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,420 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,421 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,421 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,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-23 15:58:56,423 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,423 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,423 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,424 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,425 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,426 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,426 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,426 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,428 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,428 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,429 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,429 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,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-23 15:58:56,431 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,431 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,432 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,432 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,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-23 15:58:56,434 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,435 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,435 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,435 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,437 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,437 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,438 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,438 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,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-23 15:58:56,440 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,440 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,441 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,441 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,443 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,443 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,444 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,444 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,446 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,446 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,446 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,447 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,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-23 15:58:56,448 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,448 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,449 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,449 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,451 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,451 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,452 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,452 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,454 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,454 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,455 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,455 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,457 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,457 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,457 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,458 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,460 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,460 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,460 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,461 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,463 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,463 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:56,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,463 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 15:58:56,464 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 15:58:56,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,465 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 15:58:56,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,466 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,466 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,466 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,467 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,469 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,469 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,470 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,470 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,472 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,472 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,473 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,474 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 15:58:56,474 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:58:56,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,478 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,478 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,479 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,479 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,481 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,481 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,482 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,482 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,484 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,484 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,485 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,485 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,488 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,488 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,488 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,489 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 15:58:56,490 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:58:56,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,497 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,497 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,497 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,499 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 15:58:56,499 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:58:56,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,505 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,505 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,505 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:58:56,505 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 15:58:56,505 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,548 INFO L402 nArgumentSynthesizer]: We have 112 Motzkin's Theorem applications. [2018-11-23 15:58:56,548 INFO L403 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2018-11-23 15:58:56,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,828 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,828 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,829 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,829 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 15:58:56,830 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:58:56,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,833 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,833 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,833 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,834 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 15:58:56,834 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:58:56,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,839 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,839 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,839 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,840 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,841 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,841 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,842 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,842 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,844 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,844 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,844 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,845 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 15:58:56,845 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:58:56,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,848 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,848 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,848 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,848 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,850 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,850 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,850 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,851 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,853 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,853 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,853 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,854 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,855 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,855 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,856 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,856 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,858 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,858 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,858 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,859 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,861 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,861 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,861 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,861 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,863 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,863 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,864 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,864 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,866 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,866 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,867 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,867 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,869 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,869 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,870 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,870 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,872 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,872 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,873 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,873 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,875 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,875 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,876 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,876 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,878 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,878 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,879 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,879 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,881 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,881 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,882 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,882 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,884 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,884 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,885 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,885 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,887 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,887 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,888 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,888 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,890 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,890 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,891 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,891 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,893 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,893 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,894 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,894 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,896 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,896 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,897 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,897 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,899 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,899 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 15:58:56,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,899 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:56,900 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:56,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,901 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 15:58:56,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,902 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,902 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:56,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,902 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:56,903 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:56,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,905 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,905 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:56,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,906 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:56,906 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:56,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,908 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,908 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:56,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,909 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:56,910 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 15:58:56,910 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 15:58:56,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,915 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,916 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:56,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,916 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:56,917 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:56,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,919 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,919 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:56,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,919 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:56,920 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:56,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,922 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,922 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:56,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:56,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,922 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:56,923 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:56,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:56,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,925 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,925 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:56,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,925 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:56,927 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 15:58:56,927 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 15:58:56,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,935 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,935 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:56,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:56,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:56,935 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:56,937 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 15:58:56,937 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 15:58:56,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:56,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:56,946 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:56,946 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:56,947 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:58:56,947 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 15:58:56,947 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:56,997 INFO L402 nArgumentSynthesizer]: We have 140 Motzkin's Theorem applications. [2018-11-23 15:58:56,997 INFO L403 nArgumentSynthesizer]: A total of 20 supporting invariants were added. [2018-11-23 15:58:57,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,327 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,327 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,327 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,329 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 15:58:57,329 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 15:58:57,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,334 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,334 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,335 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,336 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 15:58:57,337 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 15:58:57,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,344 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,344 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,345 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,346 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,348 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,348 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,349 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,349 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,351 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,352 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,352 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,353 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 15:58:57,353 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 15:58:57,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,359 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,359 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,359 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,360 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,362 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,363 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,363 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,364 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,366 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,366 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,367 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,367 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,370 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,370 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,370 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,371 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,373 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,373 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,374 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,374 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,377 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,377 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,377 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,378 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,380 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,380 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,381 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,382 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,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-23 15:58:57,384 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,384 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,385 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,385 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,388 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,388 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,388 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,389 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,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-23 15:58:57,392 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,392 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,392 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,393 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,395 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,396 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,396 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,397 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,599 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,599 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,600 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,601 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,603 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,603 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,603 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,604 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,618 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,618 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,619 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,619 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,621 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,621 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,622 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,622 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,627 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,627 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,627 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,628 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,630 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,630 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,631 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,631 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,634 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,634 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,634 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,635 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,637 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,637 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:57,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,638 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 15:58:57,638 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 15:58:57,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,640 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 15:58:57,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,640 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,640 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:57,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,641 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:57,641 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:57,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,644 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,644 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:57,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,645 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:57,645 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:57,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,647 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,647 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:57,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,648 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:57,648 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 15:58:57,648 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:58:57,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,652 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,652 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:57,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,652 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:57,653 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:57,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,655 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,655 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:57,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,655 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:57,656 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:57,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,658 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,658 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:57,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,659 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:57,659 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:57,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,661 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,661 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:57,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,661 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:57,662 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 15:58:57,662 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:58:57,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,669 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,669 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:57,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,670 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:57,671 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 15:58:57,671 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:58:57,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,676 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,676 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:57,677 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:58:57,677 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 15:58:57,677 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:57,711 INFO L402 nArgumentSynthesizer]: We have 112 Motzkin's Theorem applications. [2018-11-23 15:58:57,711 INFO L403 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2018-11-23 15:58:57,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,981 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,981 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:57,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,982 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:57,983 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 15:58:57,983 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:58:57,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,986 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,986 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:57,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,987 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:57,987 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 15:58:57,988 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:58:57,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,993 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,993 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:57,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,993 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:57,994 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:57,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,996 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,996 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:57,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:57,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,996 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:57,997 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:57,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:57,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:57,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:57,999 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:57,999 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:57,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:57,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:57,999 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:58,000 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 15:58:58,000 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:58:58,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,003 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,003 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:58,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,004 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:58,004 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:58,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,006 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,006 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:58,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,007 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:58,007 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:58,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,010 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,010 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:58,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,010 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:58,010 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:58,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,013 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,013 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:58,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,013 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:58,013 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:58,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,015 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,016 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:58,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,016 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:58,016 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:58,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,019 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,019 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:58,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,019 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:58,019 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:58,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,022 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,022 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:58,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,022 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:58,022 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:58,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,025 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,025 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:58,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,025 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:58,026 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:58,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,028 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,028 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:58,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,028 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:58,029 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:58,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,031 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,031 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:58,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,031 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:58,032 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:58,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,034 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,034 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:58,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,035 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:58,035 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:58,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,037 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,037 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:58,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,038 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:58,038 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:58,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,040 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,040 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:58,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,041 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:58,041 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:58,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,043 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,043 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:58,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,044 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:58,044 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:58,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,046 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,046 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:58,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,047 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:58,047 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:58,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,049 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,049 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:58,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,050 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:58,050 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:58,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,052 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,052 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:58,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,053 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:58,053 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:58,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,055 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:58,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,056 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:58,056 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:58,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,058 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,058 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 15:58:58,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,059 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 15:58:58,059 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 15:58:58,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,061 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 15:58:58,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,061 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,062 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,062 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,066 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,066 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,066 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,069 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,069 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,070 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,071 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 15:58:58,071 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 15:58:58,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,075 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,075 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,076 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,079 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,079 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,079 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,082 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,082 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,083 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,086 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,086 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,086 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,088 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 15:58:58,088 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 15:58:58,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,097 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,097 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,098 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,099 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 15:58:58,100 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 15:58:58,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,107 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,107 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,108 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:58:58,108 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 15:58:58,108 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,163 INFO L402 nArgumentSynthesizer]: We have 168 Motzkin's Theorem applications. [2018-11-23 15:58:58,163 INFO L403 nArgumentSynthesizer]: A total of 24 supporting invariants were added. [2018-11-23 15:58:58,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,916 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,916 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,916 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,917 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 15:58:58,917 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 15:58:58,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,922 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,922 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,922 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,923 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 15:58:58,923 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 15:58:58,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,935 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,935 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,935 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,938 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,939 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,939 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,942 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,942 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,942 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,943 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 15:58:58,943 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 15:58:58,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,947 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,947 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,948 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,951 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,951 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,951 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,955 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,955 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,955 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,958 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,958 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,958 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,959 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,961 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,961 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,961 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,965 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,965 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,965 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,968 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,968 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,969 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,972 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,972 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,973 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,976 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,976 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,977 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,980 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,980 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,981 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,984 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,984 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,984 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,987 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,987 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,987 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,991 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,991 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,991 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,994 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,994 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:58,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:58,997 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:58,997 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:58,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:58,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:58,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:58,997 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:58,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:58,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:58,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:59,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:59,000 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:59,000 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:59,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:59,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:59,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:59,000 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:59,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:59,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:59,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:59,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:59,003 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:59,003 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:59,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:59,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:59,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:59,003 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:59,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:59,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:59,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:59,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:59,007 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:59,007 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:59,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:59,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:59,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:59,007 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:59,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:59,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:59,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:59,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:58:59,010 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 15:58:59,010 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 15:58:59,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:58:59,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:58:59,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:58:59,010 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 15:58:59,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:58:59,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:58:59,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:58:59,012 INFO L488 BuchiCegarLoop]: Result of lasso check was UNKNOWN. I will concatenate loop to stem and try again. [2018-11-23 15:58:59,013 INFO L794 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 234#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 235#L571 assume !(main_~n~0 < 1); 224#L574 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 237#new_llENTRY ~n := #in~n; 240#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 217#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 233#new_llENTRY ~n := #in~n; 241#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 216#new_llFINAL assume true; 218#new_llEXIT >#42#return; 223#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 225#new_llFINAL assume true; 242#new_llEXIT >#46#return; 239#L574-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset; 228#L575 call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset);< 226#appendENTRY ~x.base, ~x.offset := #in~x.base, #in~x.offset;~y.base, ~y.offset := #in~y.base, #in~y.offset; 229#L563 assume !(~x.base == 0 && ~x.offset == 0);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x.base, 4 + ~x.offset, 8); 227#L565 call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset);< 226#appendENTRY [2018-11-23 15:58:59,013 INFO L796 eck$LassoCheckResult]: Loop: 226#appendENTRY ~x.base, ~x.offset := #in~x.base, #in~x.offset;~y.base, ~y.offset := #in~y.base, #in~y.offset; 229#L563 assume !(~x.base == 0 && ~x.offset == 0);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x.base, 4 + ~x.offset, 8); 227#L565 call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset);< 226#appendENTRY [2018-11-23 15:58:59,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:58:59,013 INFO L82 PathProgramCache]: Analyzing trace with hash 643179646, now seen corresponding path program 2 times [2018-11-23 15:58:59,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:58:59,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:58:59,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:59,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:58:59,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:58:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:58:59,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:58:59,031 INFO L82 PathProgramCache]: Analyzing trace with hash 62702, now seen corresponding path program 3 times [2018-11-23 15:58:59,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:58:59,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:58:59,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:59,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:58:59,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:58:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:58:59,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:58:59,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1115759441, now seen corresponding path program 3 times [2018-11-23 15:58:59,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:58:59,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:58:59,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:59,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:58:59,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:58:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:58:59,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 15:58:59,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:58:59,385 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49464cc6-315f-403f-b213-1040e153c8cd/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-23 15:58:59,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:58:59,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 15:58:59,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:58:59,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:58:59,436 INFO L478 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 6 treesize of output 5 [2018-11-23 15:58:59,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:58:59,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:58:59,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-23 15:58:59,502 INFO L478 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 11 treesize of output 1 [2018-11-23 15:58:59,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:58:59,511 INFO L478 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 11 treesize of output 8 [2018-11-23 15:58:59,514 INFO L478 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-23 15:58:59,515 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:58:59,518 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:58:59,525 INFO L478 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 11 treesize of output 8 [2018-11-23 15:58:59,527 INFO L478 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-23 15:58:59,528 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:58:59,529 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:58:59,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:58:59,533 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2018-11-23 15:58:59,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 15:58:59,584 INFO L478 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 11 treesize of output 3 [2018-11-23 15:58:59,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:58:59,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:58:59,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 15:58:59,595 INFO L478 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 11 treesize of output 3 [2018-11-23 15:58:59,596 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:58:59,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:58:59,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:58:59,601 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 15:58:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:58:59,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:58:59,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 17 [2018-11-23 15:58:59,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 15:58:59,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-11-23 15:58:59,784 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 17 states. [2018-11-23 15:59:00,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:59:00,071 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 15:59:00,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 15:59:00,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2018-11-23 15:59:00,073 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 15:59:00,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 54 transitions. [2018-11-23 15:59:00,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-23 15:59:00,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-23 15:59:00,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 54 transitions. [2018-11-23 15:59:00,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:59:00,075 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-23 15:59:00,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 54 transitions. [2018-11-23 15:59:00,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-11-23 15:59:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 15:59:00,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2018-11-23 15:59:00,080 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-11-23 15:59:00,080 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-11-23 15:59:00,080 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 15:59:00,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 51 transitions. [2018-11-23 15:59:00,081 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 15:59:00,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:59:00,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:59:00,082 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:59:00,082 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:59:00,084 INFO L794 eck$LassoCheckResult]: Stem: 424#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 417#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 418#L571 assume !(main_~n~0 < 1); 407#L574 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 423#new_llENTRY ~n := #in~n; 429#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 400#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 414#new_llENTRY ~n := #in~n; 430#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 399#new_llFINAL assume true; 401#new_llEXIT >#42#return; 425#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 441#new_llFINAL assume true; 432#new_llEXIT >#46#return; 433#L574-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset; 415#L575 call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset);< 416#appendENTRY ~x.base, ~x.offset := #in~x.base, #in~x.offset;~y.base, ~y.offset := #in~y.base, #in~y.offset; 438#L563 assume ~x.base == 0 && ~x.offset == 0;#res.base, #res.offset := ~y.base, ~y.offset; 439#appendFINAL assume true; 434#appendEXIT >#48#return; 422#L575-1 main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset; 403#L576 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 402#lengthENTRY [2018-11-23 15:59:00,084 INFO L796 eck$LassoCheckResult]: Loop: 402#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 405#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 404#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 402#lengthENTRY [2018-11-23 15:59:00,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:59:00,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1114522322, now seen corresponding path program 1 times [2018-11-23 15:59:00,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:59:00,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:59:00,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:59:00,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:59:00,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:59:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:59:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 15:59:00,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:59:00,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 15:59:00,138 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:59:00,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:59:00,138 INFO L82 PathProgramCache]: Analyzing trace with hash 37894, now seen corresponding path program 1 times [2018-11-23 15:59:00,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:59:00,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:59:00,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:59:00,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:59:00,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:59:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:59:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:59:00,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 15:59:00,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 15:59:00,205 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-11-23 15:59:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:59:00,254 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-23 15:59:00,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 15:59:00,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 49 transitions. [2018-11-23 15:59:00,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 15:59:00,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 47 transitions. [2018-11-23 15:59:00,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-23 15:59:00,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-23 15:59:00,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2018-11-23 15:59:00,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:59:00,257 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-23 15:59:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2018-11-23 15:59:00,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 15:59:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 15:59:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-23 15:59:00,261 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-23 15:59:00,261 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-23 15:59:00,261 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 15:59:00,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2018-11-23 15:59:00,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 15:59:00,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:59:00,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:59:00,263 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:59:00,263 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:59:00,263 INFO L794 eck$LassoCheckResult]: Stem: 525#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 520#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 521#L571 assume !(main_~n~0 < 1); 502#L574 call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0);< 523#new_llENTRY ~n := #in~n; 529#L548 assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); 503#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 517#new_llENTRY ~n := #in~n; 530#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 531#new_llFINAL assume true; 541#new_llEXIT >#42#return; 540#L552-1 call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; 539#new_llFINAL assume true; 537#new_llEXIT >#46#return; 535#L574-1 main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset; 518#L575 call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset);< 519#appendENTRY ~x.base, ~x.offset := #in~x.base, #in~x.offset;~y.base, ~y.offset := #in~y.base, #in~y.offset; 536#L563 assume !(~x.base == 0 && ~x.offset == 0);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x.base, 4 + ~x.offset, 8); 511#L565 call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset);< 510#appendENTRY ~x.base, ~x.offset := #in~x.base, #in~x.offset;~y.base, ~y.offset := #in~y.base, #in~y.offset; 512#L563 assume ~x.base == 0 && ~x.offset == 0;#res.base, #res.offset := ~y.base, ~y.offset; 527#appendFINAL assume true; 538#appendEXIT >#52#return; 516#L565-1 call write~$Pointer$(#t~ret7.base, #t~ret7.offset, ~x.base, 4 + ~x.offset, 8);havoc #t~mem6.base, #t~mem6.offset;havoc #t~ret7.base, #t~ret7.offset;#res.base, #res.offset := ~x.base, ~x.offset; 522#appendFINAL assume true; 532#appendEXIT >#48#return; 524#L575-1 main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset; 506#L576 call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset);< 505#lengthENTRY [2018-11-23 15:59:00,263 INFO L796 eck$LassoCheckResult]: Loop: 505#lengthENTRY ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 508#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); 507#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 505#lengthENTRY [2018-11-23 15:59:00,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:59:00,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2115869352, now seen corresponding path program 1 times [2018-11-23 15:59:00,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:59:00,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:59:00,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:59:00,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:59:00,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:59:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:59:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:59:00,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:59:00,289 INFO L82 PathProgramCache]: Analyzing trace with hash 37894, now seen corresponding path program 2 times [2018-11-23 15:59:00,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:59:00,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:59:00,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:59:00,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:59:00,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:59:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:59:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:59:00,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:59:00,295 INFO L82 PathProgramCache]: Analyzing trace with hash -923821233, now seen corresponding path program 1 times [2018-11-23 15:59:00,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:59:00,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:59:00,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:59:00,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:59:00,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:59:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:59:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:59:00,690 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 109 [2018-11-23 15:59:00,693 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:59:00,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:59:00,741 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:59:00,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:59:00,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 15:59:00,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:104 [2018-11-23 15:59:00,890 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-23 15:59:01,416 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-11-23 15:59:01,832 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 145 [2018-11-23 15:59:01,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:59:01,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:59:01,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 15:59:01,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:132, output treesize:113 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; [?] assume !(main_~n~0 < 1); [?] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [?] ~n := #in~n; [?] assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); [?] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [?] ~n := #in~n; [?] assume 0 == ~n;#res.base, #res.offset := 0, 0; [?] assume true; [?] RET #42#return; [?] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; [?] assume true; [?] RET #46#return; [?] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset; [?] CALL call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset); [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;~y.base, ~y.offset := #in~y.base, #in~y.offset; [?] assume !(~x.base == 0 && ~x.offset == 0);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x.base, 4 + ~x.offset, 8); [?] CALL call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset); [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;~y.base, ~y.offset := #in~y.base, #in~y.offset; [?] assume ~x.base == 0 && ~x.offset == 0;#res.base, #res.offset := ~y.base, ~y.offset; [?] assume true; [?] RET #52#return; [?] call write~$Pointer$(#t~ret7.base, #t~ret7.offset, ~x.base, 4 + ~x.offset, 8);havoc #t~mem6.base, #t~mem6.offset;havoc #t~ret7.base, #t~ret7.offset;#res.base, #res.offset := ~x.base, ~x.offset; [?] assume true; [?] RET #48#return; [?] main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset; [?] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0; [L570] main_~n~0 := main_#t~nondet8; [L570] havoc main_#t~nondet8; [L571-L573] assume !(main_~n~0 < 1); [L574] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548-L549] assume !(0 == ~n); [L550] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L550] ~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset; [L551] call write~int(~n, ~head~0.base, ~head~0.offset, 4); [L552] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := 0, 0; [L546-L554] ensures true; [L552] RET call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L552] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8); [L552] havoc #t~ret3.base, #t~ret3.offset; [L553] #res.base, #res.offset := ~head~0.base, ~head~0.offset; [L546-L554] ensures true; [L574] RET call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L574] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset; [L574] havoc main_#t~ret9.base, main_#t~ret9.offset; [L575] CALL call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset); [L561-L567] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L561-L567] ~y.base, ~y.offset := #in~y.base, #in~y.offset; [L563-L564] assume !(~x.base == 0 && ~x.offset == 0); [L565] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x.base, 4 + ~x.offset, 8); [L565] CALL call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset); [L561-L567] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L561-L567] ~y.base, ~y.offset := #in~y.base, #in~y.offset; [L563-L564] assume ~x.base == 0 && ~x.offset == 0; [L564] #res.base, #res.offset := ~y.base, ~y.offset; [L561-L567] ensures true; [L565] RET call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset); [L565] call write~$Pointer$(#t~ret7.base, #t~ret7.offset, ~x.base, 4 + ~x.offset, 8); [L565] havoc #t~mem6.base, #t~mem6.offset; [L565] havoc #t~ret7.base, #t~ret7.offset; [L566] #res.base, #res.offset := ~x.base, ~x.offset; [L561-L567] ensures true; [L575] RET call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset); [L575] main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset; [L575] havoc main_#t~ret10.base, main_#t~ret10.offset; [L576] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0; [L570] main_~n~0 := main_#t~nondet8; [L570] havoc main_#t~nondet8; [L571-L573] assume !(main_~n~0 < 1); [L574] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548-L549] assume !(0 == ~n); [L550] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L550] ~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset; [L551] call write~int(~n, ~head~0.base, ~head~0.offset, 4); [L552] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := 0, 0; [L546-L554] ensures true; [L552] RET call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L552] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8); [L552] havoc #t~ret3.base, #t~ret3.offset; [L553] #res.base, #res.offset := ~head~0.base, ~head~0.offset; [L546-L554] ensures true; [L574] RET call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L574] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset; [L574] havoc main_#t~ret9.base, main_#t~ret9.offset; [L575] CALL call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset); [L561-L567] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L561-L567] ~y.base, ~y.offset := #in~y.base, #in~y.offset; [L563-L564] assume !(~x.base == 0 && ~x.offset == 0); [L565] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x.base, 4 + ~x.offset, 8); [L565] CALL call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset); [L561-L567] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L561-L567] ~y.base, ~y.offset := #in~y.base, #in~y.offset; [L563-L564] assume ~x.base == 0 && ~x.offset == 0; [L564] #res.base, #res.offset := ~y.base, ~y.offset; [L561-L567] ensures true; [L565] RET call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset); [L565] call write~$Pointer$(#t~ret7.base, #t~ret7.offset, ~x.base, 4 + ~x.offset, 8); [L565] havoc #t~mem6.base, #t~mem6.offset; [L565] havoc #t~ret7.base, #t~ret7.offset; [L566] #res.base, #res.offset := ~x.base, ~x.offset; [L561-L567] ensures true; [L575] RET call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset); [L575] main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset; [L575] havoc main_#t~ret10.base, main_#t~ret10.offset; [L576] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9, main_#t~ret10, main_#t~ret11, main_~n~0, main_~x~0, main_~y~0, main_~y_length~0; [L570] main_~n~0 := main_#t~nondet8; [L570] havoc main_#t~nondet8; [L571] COND FALSE !(main_~n~0 < 1) [L574] CALL call main_#t~ret9 := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L574] RET call main_#t~ret9 := new_ll(main_~n~0); [L574] main_~x~0 := main_#t~ret9; [L574] havoc main_#t~ret9; [L575] CALL call main_#t~ret10 := append(main_~x~0, main_~x~0); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] CALL call #t~ret7 := append(#t~mem6, ~y); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND TRUE ~x == { base: 0, offset: 0 } [L564] #res := ~y; [L565] RET call #t~ret7 := append(#t~mem6, ~y); [L565] FCALL call write~$Pointer$(#t~ret7, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] havoc #t~mem6; [L565] havoc #t~ret7; [L566] #res := ~x; [L575] RET call main_#t~ret10 := append(main_~x~0, main_~x~0); [L575] main_~y~0 := main_#t~ret10; [L575] havoc main_#t~ret10; [L576] CALL call main_#t~ret11 := length(main_~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9, main_#t~ret10, main_#t~ret11, main_~n~0, main_~x~0, main_~y~0, main_~y_length~0; [L570] main_~n~0 := main_#t~nondet8; [L570] havoc main_#t~nondet8; [L571] COND FALSE !(main_~n~0 < 1) [L574] CALL call main_#t~ret9 := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L574] RET call main_#t~ret9 := new_ll(main_~n~0); [L574] main_~x~0 := main_#t~ret9; [L574] havoc main_#t~ret9; [L575] CALL call main_#t~ret10 := append(main_~x~0, main_~x~0); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] CALL call #t~ret7 := append(#t~mem6, ~y); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND TRUE ~x == { base: 0, offset: 0 } [L564] #res := ~y; [L565] RET call #t~ret7 := append(#t~mem6, ~y); [L565] FCALL call write~$Pointer$(#t~ret7, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] havoc #t~mem6; [L565] havoc #t~ret7; [L566] #res := ~x; [L575] RET call main_#t~ret10 := append(main_~x~0, main_~x~0); [L575] main_~y~0 := main_#t~ret10; [L575] havoc main_#t~ret10; [L576] CALL call main_#t~ret11 := length(main_~y~0); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet8; [L570] havoc #t~nondet8; [L571] COND FALSE !(~n~0 < 1) [L574] CALL call #t~ret9 := new_ll(~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L574] RET call #t~ret9 := new_ll(~n~0); [L574] ~x~0 := #t~ret9; [L574] havoc #t~ret9; [L575] CALL call #t~ret10 := append(~x~0, ~x~0); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] CALL call #t~ret7 := append(#t~mem6, ~y); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND TRUE ~x == { base: 0, offset: 0 } [L564] #res := ~y; [L565] RET call #t~ret7 := append(#t~mem6, ~y); [L565] FCALL call write~$Pointer$(#t~ret7, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] havoc #t~mem6; [L565] havoc #t~ret7; [L566] #res := ~x; [L575] RET call #t~ret10 := append(~x~0, ~x~0); [L575] ~y~0 := #t~ret10; [L575] havoc #t~ret10; [L576] CALL call #t~ret11 := length(~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet8; [L570] havoc #t~nondet8; [L571] COND FALSE !(~n~0 < 1) [L574] CALL call #t~ret9 := new_ll(~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L574] RET call #t~ret9 := new_ll(~n~0); [L574] ~x~0 := #t~ret9; [L574] havoc #t~ret9; [L575] CALL call #t~ret10 := append(~x~0, ~x~0); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] CALL call #t~ret7 := append(#t~mem6, ~y); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND TRUE ~x == { base: 0, offset: 0 } [L564] #res := ~y; [L565] RET call #t~ret7 := append(#t~mem6, ~y); [L565] FCALL call write~$Pointer$(#t~ret7, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] havoc #t~mem6; [L565] havoc #t~ret7; [L566] #res := ~x; [L575] RET call #t~ret10 := append(~x~0, ~x~0); [L575] ~y~0 := #t~ret10; [L575] havoc #t~ret10; [L576] CALL call #t~ret11 := length(~y~0); [L570] int n = __VERIFIER_nondet_int(); [L571] COND FALSE !(n < 1) [L574] CALL, EXPR new_ll(n) [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n [L552] CALL, EXPR new_ll(n-1) [L548] COND TRUE n == 0 [L549] return ((void *)0); [L552] RET, EXPR new_ll(n-1) [L552] head->next = new_ll(n-1) [L553] return head; [L574] RET, EXPR new_ll(n) [L574] node_t* x = new_ll(n); [L575] CALL, EXPR append(x, x) [L563] COND FALSE !(x == ((void *)0)) [L565] EXPR x->next [L565] CALL, EXPR append(x->next, y) [L563] COND TRUE x == ((void *)0) [L564] return y; [L565] RET, EXPR append(x->next, y) [L565] x->next = append(x->next, y) [L566] return x; [L575] RET, EXPR append(x, x) [L575] node_t* y = append(x, x); [L576] CALL length(y) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [?] assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [?] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); [L555-L560] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [L557-L558] assume !(~xs.base == 0 && ~xs.offset == 0); [L559] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [L559] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L555-L560] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [L557-L558] assume !(~xs.base == 0 && ~xs.offset == 0); [L559] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [L559] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) ----- [2018-11-23 15:59:01,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:59:01 BoogieIcfgContainer [2018-11-23 15:59:01,996 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 15:59:01,997 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:59:01,997 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:59:01,997 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:59:01,998 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:58:51" (3/4) ... [2018-11-23 15:59:02,000 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; [?] assume !(main_~n~0 < 1); [?] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [?] ~n := #in~n; [?] assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); [?] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [?] ~n := #in~n; [?] assume 0 == ~n;#res.base, #res.offset := 0, 0; [?] assume true; [?] RET #42#return; [?] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; [?] assume true; [?] RET #46#return; [?] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset; [?] CALL call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset); [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;~y.base, ~y.offset := #in~y.base, #in~y.offset; [?] assume !(~x.base == 0 && ~x.offset == 0);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x.base, 4 + ~x.offset, 8); [?] CALL call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset); [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;~y.base, ~y.offset := #in~y.base, #in~y.offset; [?] assume ~x.base == 0 && ~x.offset == 0;#res.base, #res.offset := ~y.base, ~y.offset; [?] assume true; [?] RET #52#return; [?] call write~$Pointer$(#t~ret7.base, #t~ret7.offset, ~x.base, 4 + ~x.offset, 8);havoc #t~mem6.base, #t~mem6.offset;havoc #t~ret7.base, #t~ret7.offset;#res.base, #res.offset := ~x.base, ~x.offset; [?] assume true; [?] RET #48#return; [?] main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset; [?] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0; [L570] main_~n~0 := main_#t~nondet8; [L570] havoc main_#t~nondet8; [L571-L573] assume !(main_~n~0 < 1); [L574] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548-L549] assume !(0 == ~n); [L550] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L550] ~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset; [L551] call write~int(~n, ~head~0.base, ~head~0.offset, 4); [L552] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := 0, 0; [L546-L554] ensures true; [L552] RET call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L552] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8); [L552] havoc #t~ret3.base, #t~ret3.offset; [L553] #res.base, #res.offset := ~head~0.base, ~head~0.offset; [L546-L554] ensures true; [L574] RET call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L574] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset; [L574] havoc main_#t~ret9.base, main_#t~ret9.offset; [L575] CALL call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset); [L561-L567] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L561-L567] ~y.base, ~y.offset := #in~y.base, #in~y.offset; [L563-L564] assume !(~x.base == 0 && ~x.offset == 0); [L565] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x.base, 4 + ~x.offset, 8); [L565] CALL call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset); [L561-L567] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L561-L567] ~y.base, ~y.offset := #in~y.base, #in~y.offset; [L563-L564] assume ~x.base == 0 && ~x.offset == 0; [L564] #res.base, #res.offset := ~y.base, ~y.offset; [L561-L567] ensures true; [L565] RET call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset); [L565] call write~$Pointer$(#t~ret7.base, #t~ret7.offset, ~x.base, 4 + ~x.offset, 8); [L565] havoc #t~mem6.base, #t~mem6.offset; [L565] havoc #t~ret7.base, #t~ret7.offset; [L566] #res.base, #res.offset := ~x.base, ~x.offset; [L561-L567] ensures true; [L575] RET call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset); [L575] main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset; [L575] havoc main_#t~ret10.base, main_#t~ret10.offset; [L576] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0; [L570] main_~n~0 := main_#t~nondet8; [L570] havoc main_#t~nondet8; [L571-L573] assume !(main_~n~0 < 1); [L574] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548-L549] assume !(0 == ~n); [L550] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L550] ~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset; [L551] call write~int(~n, ~head~0.base, ~head~0.offset, 4); [L552] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := 0, 0; [L546-L554] ensures true; [L552] RET call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L552] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8); [L552] havoc #t~ret3.base, #t~ret3.offset; [L553] #res.base, #res.offset := ~head~0.base, ~head~0.offset; [L546-L554] ensures true; [L574] RET call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L574] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset; [L574] havoc main_#t~ret9.base, main_#t~ret9.offset; [L575] CALL call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset); [L561-L567] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L561-L567] ~y.base, ~y.offset := #in~y.base, #in~y.offset; [L563-L564] assume !(~x.base == 0 && ~x.offset == 0); [L565] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x.base, 4 + ~x.offset, 8); [L565] CALL call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset); [L561-L567] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L561-L567] ~y.base, ~y.offset := #in~y.base, #in~y.offset; [L563-L564] assume ~x.base == 0 && ~x.offset == 0; [L564] #res.base, #res.offset := ~y.base, ~y.offset; [L561-L567] ensures true; [L565] RET call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset); [L565] call write~$Pointer$(#t~ret7.base, #t~ret7.offset, ~x.base, 4 + ~x.offset, 8); [L565] havoc #t~mem6.base, #t~mem6.offset; [L565] havoc #t~ret7.base, #t~ret7.offset; [L566] #res.base, #res.offset := ~x.base, ~x.offset; [L561-L567] ensures true; [L575] RET call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset); [L575] main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset; [L575] havoc main_#t~ret10.base, main_#t~ret10.offset; [L576] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9, main_#t~ret10, main_#t~ret11, main_~n~0, main_~x~0, main_~y~0, main_~y_length~0; [L570] main_~n~0 := main_#t~nondet8; [L570] havoc main_#t~nondet8; [L571] COND FALSE !(main_~n~0 < 1) [L574] CALL call main_#t~ret9 := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L574] RET call main_#t~ret9 := new_ll(main_~n~0); [L574] main_~x~0 := main_#t~ret9; [L574] havoc main_#t~ret9; [L575] CALL call main_#t~ret10 := append(main_~x~0, main_~x~0); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] CALL call #t~ret7 := append(#t~mem6, ~y); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND TRUE ~x == { base: 0, offset: 0 } [L564] #res := ~y; [L565] RET call #t~ret7 := append(#t~mem6, ~y); [L565] FCALL call write~$Pointer$(#t~ret7, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] havoc #t~mem6; [L565] havoc #t~ret7; [L566] #res := ~x; [L575] RET call main_#t~ret10 := append(main_~x~0, main_~x~0); [L575] main_~y~0 := main_#t~ret10; [L575] havoc main_#t~ret10; [L576] CALL call main_#t~ret11 := length(main_~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9, main_#t~ret10, main_#t~ret11, main_~n~0, main_~x~0, main_~y~0, main_~y_length~0; [L570] main_~n~0 := main_#t~nondet8; [L570] havoc main_#t~nondet8; [L571] COND FALSE !(main_~n~0 < 1) [L574] CALL call main_#t~ret9 := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L574] RET call main_#t~ret9 := new_ll(main_~n~0); [L574] main_~x~0 := main_#t~ret9; [L574] havoc main_#t~ret9; [L575] CALL call main_#t~ret10 := append(main_~x~0, main_~x~0); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] CALL call #t~ret7 := append(#t~mem6, ~y); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND TRUE ~x == { base: 0, offset: 0 } [L564] #res := ~y; [L565] RET call #t~ret7 := append(#t~mem6, ~y); [L565] FCALL call write~$Pointer$(#t~ret7, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] havoc #t~mem6; [L565] havoc #t~ret7; [L566] #res := ~x; [L575] RET call main_#t~ret10 := append(main_~x~0, main_~x~0); [L575] main_~y~0 := main_#t~ret10; [L575] havoc main_#t~ret10; [L576] CALL call main_#t~ret11 := length(main_~y~0); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet8; [L570] havoc #t~nondet8; [L571] COND FALSE !(~n~0 < 1) [L574] CALL call #t~ret9 := new_ll(~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L574] RET call #t~ret9 := new_ll(~n~0); [L574] ~x~0 := #t~ret9; [L574] havoc #t~ret9; [L575] CALL call #t~ret10 := append(~x~0, ~x~0); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] CALL call #t~ret7 := append(#t~mem6, ~y); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND TRUE ~x == { base: 0, offset: 0 } [L564] #res := ~y; [L565] RET call #t~ret7 := append(#t~mem6, ~y); [L565] FCALL call write~$Pointer$(#t~ret7, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] havoc #t~mem6; [L565] havoc #t~ret7; [L566] #res := ~x; [L575] RET call #t~ret10 := append(~x~0, ~x~0); [L575] ~y~0 := #t~ret10; [L575] havoc #t~ret10; [L576] CALL call #t~ret11 := length(~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet8; [L570] havoc #t~nondet8; [L571] COND FALSE !(~n~0 < 1) [L574] CALL call #t~ret9 := new_ll(~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L574] RET call #t~ret9 := new_ll(~n~0); [L574] ~x~0 := #t~ret9; [L574] havoc #t~ret9; [L575] CALL call #t~ret10 := append(~x~0, ~x~0); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] CALL call #t~ret7 := append(#t~mem6, ~y); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND TRUE ~x == { base: 0, offset: 0 } [L564] #res := ~y; [L565] RET call #t~ret7 := append(#t~mem6, ~y); [L565] FCALL call write~$Pointer$(#t~ret7, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] havoc #t~mem6; [L565] havoc #t~ret7; [L566] #res := ~x; [L575] RET call #t~ret10 := append(~x~0, ~x~0); [L575] ~y~0 := #t~ret10; [L575] havoc #t~ret10; [L576] CALL call #t~ret11 := length(~y~0); [L570] int n = __VERIFIER_nondet_int(); [L571] COND FALSE !(n < 1) [L574] CALL, EXPR new_ll(n) [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n [L552] CALL, EXPR new_ll(n-1) [L548] COND TRUE n == 0 [L549] return ((void *)0); [L552] RET, EXPR new_ll(n-1) [L552] head->next = new_ll(n-1) [L553] return head; [L574] RET, EXPR new_ll(n) [L574] node_t* x = new_ll(n); [L575] CALL, EXPR append(x, x) [L563] COND FALSE !(x == ((void *)0)) [L565] EXPR x->next [L565] CALL, EXPR append(x->next, y) [L563] COND TRUE x == ((void *)0) [L564] return y; [L565] RET, EXPR append(x->next, y) [L565] x->next = append(x->next, y) [L566] return x; [L575] RET, EXPR append(x, x) [L575] node_t* y = append(x, x); [L576] CALL length(y) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [?] assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [?] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); [L555-L560] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [L557-L558] assume !(~xs.base == 0 && ~xs.offset == 0); [L559] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [L559] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L555-L560] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [L557-L558] assume !(~xs.base == 0 && ~xs.offset == 0); [L559] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [L559] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) ----- [2018-11-23 15:59:02,076 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_49464cc6-315f-403f-b213-1040e153c8cd/bin-2019/uautomizer/witness.graphml [2018-11-23 15:59:02,076 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:59:02,077 INFO L168 Benchmark]: Toolchain (without parser) took 11222.83 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 656.4 MB). Free memory was 956.6 MB in the beginning and 1.3 GB in the end (delta: -383.3 MB). Peak memory consumption was 273.1 MB. Max. memory is 11.5 GB. [2018-11-23 15:59:02,077 INFO L168 Benchmark]: CDTParser took 0.17 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-23 15:59:02,077 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 15:59:02,078 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:59:02,078 INFO L168 Benchmark]: Boogie Preprocessor took 22.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:59:02,078 INFO L168 Benchmark]: RCFGBuilder took 257.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:59:02,079 INFO L168 Benchmark]: BuchiAutomizer took 10421.19 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 519.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -240.3 MB). Peak memory consumption was 808.6 MB. Max. memory is 11.5 GB. [2018-11-23 15:59:02,079 INFO L168 Benchmark]: Witness Printer took 79.08 ms. Allocated memory is still 1.7 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:59:02,082 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.17 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 406.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 257.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10421.19 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 519.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -240.3 MB). Peak memory consumption was 808.6 MB. Max. memory is 11.5 GB. * Witness Printer took 79.08 ms. Allocated memory is still 1.7 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(n) and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 17 locations. The remainder module has 41 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.3s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 9.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 43 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 74 SDtfs, 62 SDslu, 311 SDs, 0 SdLazy, 301 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital130 mio100 ax100 hnf100 lsp95 ukn24 mio100 lsp46 div100 bol100 ite100 ukn100 eq214 hnf86 smp100 dnf130 smp100 tf100 neg94 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 84ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 555]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {y_length=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3bd60aa3=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@399c45f8=0, xs=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@36b5661d=0, NULL=0, \result=0, x=0, y=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@583d790d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1255e2ad=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1255e2ad=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3bd60aa3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@498a8492=0, n=0, NULL=0, y=0, xs=2, NULL=0, xs=0, xs=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@399c45f8=0, NULL=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 555]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; [?] assume !(main_~n~0 < 1); [?] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [?] ~n := #in~n; [?] assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); [?] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [?] ~n := #in~n; [?] assume 0 == ~n;#res.base, #res.offset := 0, 0; [?] assume true; [?] RET #42#return; [?] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; [?] assume true; [?] RET #46#return; [?] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset; [?] CALL call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset); [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;~y.base, ~y.offset := #in~y.base, #in~y.offset; [?] assume !(~x.base == 0 && ~x.offset == 0);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x.base, 4 + ~x.offset, 8); [?] CALL call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset); [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;~y.base, ~y.offset := #in~y.base, #in~y.offset; [?] assume ~x.base == 0 && ~x.offset == 0;#res.base, #res.offset := ~y.base, ~y.offset; [?] assume true; [?] RET #52#return; [?] call write~$Pointer$(#t~ret7.base, #t~ret7.offset, ~x.base, 4 + ~x.offset, 8);havoc #t~mem6.base, #t~mem6.offset;havoc #t~ret7.base, #t~ret7.offset;#res.base, #res.offset := ~x.base, ~x.offset; [?] assume true; [?] RET #48#return; [?] main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset; [?] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0; [L570] main_~n~0 := main_#t~nondet8; [L570] havoc main_#t~nondet8; [L571-L573] assume !(main_~n~0 < 1); [L574] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548-L549] assume !(0 == ~n); [L550] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L550] ~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset; [L551] call write~int(~n, ~head~0.base, ~head~0.offset, 4); [L552] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := 0, 0; [L546-L554] ensures true; [L552] RET call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L552] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8); [L552] havoc #t~ret3.base, #t~ret3.offset; [L553] #res.base, #res.offset := ~head~0.base, ~head~0.offset; [L546-L554] ensures true; [L574] RET call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L574] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset; [L574] havoc main_#t~ret9.base, main_#t~ret9.offset; [L575] CALL call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset); [L561-L567] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L561-L567] ~y.base, ~y.offset := #in~y.base, #in~y.offset; [L563-L564] assume !(~x.base == 0 && ~x.offset == 0); [L565] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x.base, 4 + ~x.offset, 8); [L565] CALL call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset); [L561-L567] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L561-L567] ~y.base, ~y.offset := #in~y.base, #in~y.offset; [L563-L564] assume ~x.base == 0 && ~x.offset == 0; [L564] #res.base, #res.offset := ~y.base, ~y.offset; [L561-L567] ensures true; [L565] RET call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset); [L565] call write~$Pointer$(#t~ret7.base, #t~ret7.offset, ~x.base, 4 + ~x.offset, 8); [L565] havoc #t~mem6.base, #t~mem6.offset; [L565] havoc #t~ret7.base, #t~ret7.offset; [L566] #res.base, #res.offset := ~x.base, ~x.offset; [L561-L567] ensures true; [L575] RET call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset); [L575] main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset; [L575] havoc main_#t~ret10.base, main_#t~ret10.offset; [L576] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0; [L570] main_~n~0 := main_#t~nondet8; [L570] havoc main_#t~nondet8; [L571-L573] assume !(main_~n~0 < 1); [L574] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548-L549] assume !(0 == ~n); [L550] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L550] ~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset; [L551] call write~int(~n, ~head~0.base, ~head~0.offset, 4); [L552] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := 0, 0; [L546-L554] ensures true; [L552] RET call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L552] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8); [L552] havoc #t~ret3.base, #t~ret3.offset; [L553] #res.base, #res.offset := ~head~0.base, ~head~0.offset; [L546-L554] ensures true; [L574] RET call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L574] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset; [L574] havoc main_#t~ret9.base, main_#t~ret9.offset; [L575] CALL call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset); [L561-L567] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L561-L567] ~y.base, ~y.offset := #in~y.base, #in~y.offset; [L563-L564] assume !(~x.base == 0 && ~x.offset == 0); [L565] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x.base, 4 + ~x.offset, 8); [L565] CALL call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset); [L561-L567] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L561-L567] ~y.base, ~y.offset := #in~y.base, #in~y.offset; [L563-L564] assume ~x.base == 0 && ~x.offset == 0; [L564] #res.base, #res.offset := ~y.base, ~y.offset; [L561-L567] ensures true; [L565] RET call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset); [L565] call write~$Pointer$(#t~ret7.base, #t~ret7.offset, ~x.base, 4 + ~x.offset, 8); [L565] havoc #t~mem6.base, #t~mem6.offset; [L565] havoc #t~ret7.base, #t~ret7.offset; [L566] #res.base, #res.offset := ~x.base, ~x.offset; [L561-L567] ensures true; [L575] RET call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset); [L575] main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset; [L575] havoc main_#t~ret10.base, main_#t~ret10.offset; [L576] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9, main_#t~ret10, main_#t~ret11, main_~n~0, main_~x~0, main_~y~0, main_~y_length~0; [L570] main_~n~0 := main_#t~nondet8; [L570] havoc main_#t~nondet8; [L571] COND FALSE !(main_~n~0 < 1) [L574] CALL call main_#t~ret9 := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L574] RET call main_#t~ret9 := new_ll(main_~n~0); [L574] main_~x~0 := main_#t~ret9; [L574] havoc main_#t~ret9; [L575] CALL call main_#t~ret10 := append(main_~x~0, main_~x~0); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] CALL call #t~ret7 := append(#t~mem6, ~y); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND TRUE ~x == { base: 0, offset: 0 } [L564] #res := ~y; [L565] RET call #t~ret7 := append(#t~mem6, ~y); [L565] FCALL call write~$Pointer$(#t~ret7, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] havoc #t~mem6; [L565] havoc #t~ret7; [L566] #res := ~x; [L575] RET call main_#t~ret10 := append(main_~x~0, main_~x~0); [L575] main_~y~0 := main_#t~ret10; [L575] havoc main_#t~ret10; [L576] CALL call main_#t~ret11 := length(main_~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9, main_#t~ret10, main_#t~ret11, main_~n~0, main_~x~0, main_~y~0, main_~y_length~0; [L570] main_~n~0 := main_#t~nondet8; [L570] havoc main_#t~nondet8; [L571] COND FALSE !(main_~n~0 < 1) [L574] CALL call main_#t~ret9 := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L574] RET call main_#t~ret9 := new_ll(main_~n~0); [L574] main_~x~0 := main_#t~ret9; [L574] havoc main_#t~ret9; [L575] CALL call main_#t~ret10 := append(main_~x~0, main_~x~0); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] CALL call #t~ret7 := append(#t~mem6, ~y); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND TRUE ~x == { base: 0, offset: 0 } [L564] #res := ~y; [L565] RET call #t~ret7 := append(#t~mem6, ~y); [L565] FCALL call write~$Pointer$(#t~ret7, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] havoc #t~mem6; [L565] havoc #t~ret7; [L566] #res := ~x; [L575] RET call main_#t~ret10 := append(main_~x~0, main_~x~0); [L575] main_~y~0 := main_#t~ret10; [L575] havoc main_#t~ret10; [L576] CALL call main_#t~ret11 := length(main_~y~0); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet8; [L570] havoc #t~nondet8; [L571] COND FALSE !(~n~0 < 1) [L574] CALL call #t~ret9 := new_ll(~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L574] RET call #t~ret9 := new_ll(~n~0); [L574] ~x~0 := #t~ret9; [L574] havoc #t~ret9; [L575] CALL call #t~ret10 := append(~x~0, ~x~0); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] CALL call #t~ret7 := append(#t~mem6, ~y); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND TRUE ~x == { base: 0, offset: 0 } [L564] #res := ~y; [L565] RET call #t~ret7 := append(#t~mem6, ~y); [L565] FCALL call write~$Pointer$(#t~ret7, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] havoc #t~mem6; [L565] havoc #t~ret7; [L566] #res := ~x; [L575] RET call #t~ret10 := append(~x~0, ~x~0); [L575] ~y~0 := #t~ret10; [L575] havoc #t~ret10; [L576] CALL call #t~ret11 := length(~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet8; [L570] havoc #t~nondet8; [L571] COND FALSE !(~n~0 < 1) [L574] CALL call #t~ret9 := new_ll(~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L574] RET call #t~ret9 := new_ll(~n~0); [L574] ~x~0 := #t~ret9; [L574] havoc #t~ret9; [L575] CALL call #t~ret10 := append(~x~0, ~x~0); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] CALL call #t~ret7 := append(#t~mem6, ~y); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND TRUE ~x == { base: 0, offset: 0 } [L564] #res := ~y; [L565] RET call #t~ret7 := append(#t~mem6, ~y); [L565] FCALL call write~$Pointer$(#t~ret7, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] havoc #t~mem6; [L565] havoc #t~ret7; [L566] #res := ~x; [L575] RET call #t~ret10 := append(~x~0, ~x~0); [L575] ~y~0 := #t~ret10; [L575] havoc #t~ret10; [L576] CALL call #t~ret11 := length(~y~0); [L570] int n = __VERIFIER_nondet_int(); [L571] COND FALSE !(n < 1) [L574] CALL, EXPR new_ll(n) [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n [L552] CALL, EXPR new_ll(n-1) [L548] COND TRUE n == 0 [L549] return ((void *)0); [L552] RET, EXPR new_ll(n-1) [L552] head->next = new_ll(n-1) [L553] return head; [L574] RET, EXPR new_ll(n) [L574] node_t* x = new_ll(n); [L575] CALL, EXPR append(x, x) [L563] COND FALSE !(x == ((void *)0)) [L565] EXPR x->next [L565] CALL, EXPR append(x->next, y) [L563] COND TRUE x == ((void *)0) [L564] return y; [L565] RET, EXPR append(x->next, y) [L565] x->next = append(x->next, y) [L566] return x; [L575] RET, EXPR append(x, x) [L575] node_t* y = append(x, x); [L576] CALL length(y) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [?] assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [?] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); [L555-L560] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [L557-L558] assume !(~xs.base == 0 && ~xs.offset == 0); [L559] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [L559] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L555-L560] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [L557-L558] assume !(~xs.base == 0 && ~xs.offset == 0); [L559] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [L559] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; [?] assume !(main_~n~0 < 1); [?] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [?] ~n := #in~n; [?] assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(~n, ~head~0.base, ~head~0.offset, 4); [?] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [?] ~n := #in~n; [?] assume 0 == ~n;#res.base, #res.offset := 0, 0; [?] assume true; [?] RET #42#return; [?] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset; [?] assume true; [?] RET #46#return; [?] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset;havoc main_#t~ret9.base, main_#t~ret9.offset; [?] CALL call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset); [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;~y.base, ~y.offset := #in~y.base, #in~y.offset; [?] assume !(~x.base == 0 && ~x.offset == 0);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x.base, 4 + ~x.offset, 8); [?] CALL call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset); [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;~y.base, ~y.offset := #in~y.base, #in~y.offset; [?] assume ~x.base == 0 && ~x.offset == 0;#res.base, #res.offset := ~y.base, ~y.offset; [?] assume true; [?] RET #52#return; [?] call write~$Pointer$(#t~ret7.base, #t~ret7.offset, ~x.base, 4 + ~x.offset, 8);havoc #t~mem6.base, #t~mem6.offset;havoc #t~ret7.base, #t~ret7.offset;#res.base, #res.offset := ~x.base, ~x.offset; [?] assume true; [?] RET #48#return; [?] main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset; [?] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0; [L570] main_~n~0 := main_#t~nondet8; [L570] havoc main_#t~nondet8; [L571-L573] assume !(main_~n~0 < 1); [L574] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548-L549] assume !(0 == ~n); [L550] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L550] ~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset; [L551] call write~int(~n, ~head~0.base, ~head~0.offset, 4); [L552] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := 0, 0; [L546-L554] ensures true; [L552] RET call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L552] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8); [L552] havoc #t~ret3.base, #t~ret3.offset; [L553] #res.base, #res.offset := ~head~0.base, ~head~0.offset; [L546-L554] ensures true; [L574] RET call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L574] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset; [L574] havoc main_#t~ret9.base, main_#t~ret9.offset; [L575] CALL call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset); [L561-L567] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L561-L567] ~y.base, ~y.offset := #in~y.base, #in~y.offset; [L563-L564] assume !(~x.base == 0 && ~x.offset == 0); [L565] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x.base, 4 + ~x.offset, 8); [L565] CALL call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset); [L561-L567] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L561-L567] ~y.base, ~y.offset := #in~y.base, #in~y.offset; [L563-L564] assume ~x.base == 0 && ~x.offset == 0; [L564] #res.base, #res.offset := ~y.base, ~y.offset; [L561-L567] ensures true; [L565] RET call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset); [L565] call write~$Pointer$(#t~ret7.base, #t~ret7.offset, ~x.base, 4 + ~x.offset, 8); [L565] havoc #t~mem6.base, #t~mem6.offset; [L565] havoc #t~ret7.base, #t~ret7.offset; [L566] #res.base, #res.offset := ~x.base, ~x.offset; [L561-L567] ensures true; [L575] RET call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset); [L575] main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset; [L575] havoc main_#t~ret10.base, main_#t~ret10.offset; [L576] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9.base, main_#t~ret9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11, main_~n~0, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~y_length~0; [L570] main_~n~0 := main_#t~nondet8; [L570] havoc main_#t~nondet8; [L571-L573] assume !(main_~n~0 < 1); [L574] CALL call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548-L549] assume !(0 == ~n); [L550] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L550] ~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset; [L551] call write~int(~n, ~head~0.base, ~head~0.offset, 4); [L552] CALL call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548-L549] assume 0 == ~n; [L549] #res.base, #res.offset := 0, 0; [L546-L554] ensures true; [L552] RET call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1); [L552] call write~$Pointer$(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8); [L552] havoc #t~ret3.base, #t~ret3.offset; [L553] #res.base, #res.offset := ~head~0.base, ~head~0.offset; [L546-L554] ensures true; [L574] RET call main_#t~ret9.base, main_#t~ret9.offset := new_ll(main_~n~0); [L574] main_~x~0.base, main_~x~0.offset := main_#t~ret9.base, main_#t~ret9.offset; [L574] havoc main_#t~ret9.base, main_#t~ret9.offset; [L575] CALL call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset); [L561-L567] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L561-L567] ~y.base, ~y.offset := #in~y.base, #in~y.offset; [L563-L564] assume !(~x.base == 0 && ~x.offset == 0); [L565] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x.base, 4 + ~x.offset, 8); [L565] CALL call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset); [L561-L567] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L561-L567] ~y.base, ~y.offset := #in~y.base, #in~y.offset; [L563-L564] assume ~x.base == 0 && ~x.offset == 0; [L564] #res.base, #res.offset := ~y.base, ~y.offset; [L561-L567] ensures true; [L565] RET call #t~ret7.base, #t~ret7.offset := append(#t~mem6.base, #t~mem6.offset, ~y.base, ~y.offset); [L565] call write~$Pointer$(#t~ret7.base, #t~ret7.offset, ~x.base, 4 + ~x.offset, 8); [L565] havoc #t~mem6.base, #t~mem6.offset; [L565] havoc #t~ret7.base, #t~ret7.offset; [L566] #res.base, #res.offset := ~x.base, ~x.offset; [L561-L567] ensures true; [L575] RET call main_#t~ret10.base, main_#t~ret10.offset := append(main_~x~0.base, main_~x~0.offset, main_~x~0.base, main_~x~0.offset); [L575] main_~y~0.base, main_~y~0.offset := main_#t~ret10.base, main_#t~ret10.offset; [L575] havoc main_#t~ret10.base, main_#t~ret10.offset; [L576] CALL call main_#t~ret11 := length(main_~y~0.base, main_~y~0.offset); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9, main_#t~ret10, main_#t~ret11, main_~n~0, main_~x~0, main_~y~0, main_~y_length~0; [L570] main_~n~0 := main_#t~nondet8; [L570] havoc main_#t~nondet8; [L571] COND FALSE !(main_~n~0 < 1) [L574] CALL call main_#t~ret9 := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L574] RET call main_#t~ret9 := new_ll(main_~n~0); [L574] main_~x~0 := main_#t~ret9; [L574] havoc main_#t~ret9; [L575] CALL call main_#t~ret10 := append(main_~x~0, main_~x~0); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] CALL call #t~ret7 := append(#t~mem6, ~y); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND TRUE ~x == { base: 0, offset: 0 } [L564] #res := ~y; [L565] RET call #t~ret7 := append(#t~mem6, ~y); [L565] FCALL call write~$Pointer$(#t~ret7, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] havoc #t~mem6; [L565] havoc #t~ret7; [L566] #res := ~x; [L575] RET call main_#t~ret10 := append(main_~x~0, main_~x~0); [L575] main_~y~0 := main_#t~ret10; [L575] havoc main_#t~ret10; [L576] CALL call main_#t~ret11 := length(main_~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~ret9, main_#t~ret10, main_#t~ret11, main_~n~0, main_~x~0, main_~y~0, main_~y_length~0; [L570] main_~n~0 := main_#t~nondet8; [L570] havoc main_#t~nondet8; [L571] COND FALSE !(main_~n~0 < 1) [L574] CALL call main_#t~ret9 := new_ll(main_~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L574] RET call main_#t~ret9 := new_ll(main_~n~0); [L574] main_~x~0 := main_#t~ret9; [L574] havoc main_#t~ret9; [L575] CALL call main_#t~ret10 := append(main_~x~0, main_~x~0); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] CALL call #t~ret7 := append(#t~mem6, ~y); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND TRUE ~x == { base: 0, offset: 0 } [L564] #res := ~y; [L565] RET call #t~ret7 := append(#t~mem6, ~y); [L565] FCALL call write~$Pointer$(#t~ret7, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] havoc #t~mem6; [L565] havoc #t~ret7; [L566] #res := ~x; [L575] RET call main_#t~ret10 := append(main_~x~0, main_~x~0); [L575] main_~y~0 := main_#t~ret10; [L575] havoc main_#t~ret10; [L576] CALL call main_#t~ret11 := length(main_~y~0); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet8; [L570] havoc #t~nondet8; [L571] COND FALSE !(~n~0 < 1) [L574] CALL call #t~ret9 := new_ll(~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L574] RET call #t~ret9 := new_ll(~n~0); [L574] ~x~0 := #t~ret9; [L574] havoc #t~ret9; [L575] CALL call #t~ret10 := append(~x~0, ~x~0); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] CALL call #t~ret7 := append(#t~mem6, ~y); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND TRUE ~x == { base: 0, offset: 0 } [L564] #res := ~y; [L565] RET call #t~ret7 := append(#t~mem6, ~y); [L565] FCALL call write~$Pointer$(#t~ret7, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] havoc #t~mem6; [L565] havoc #t~ret7; [L566] #res := ~x; [L575] RET call #t~ret10 := append(~x~0, ~x~0); [L575] ~y~0 := #t~ret10; [L575] havoc #t~ret10; [L576] CALL call #t~ret11 := length(~y~0); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L570] ~n~0 := #t~nondet8; [L570] havoc #t~nondet8; [L571] COND FALSE !(~n~0 < 1) [L574] CALL call #t~ret9 := new_ll(~n~0); [L546-L554] ~n := #in~n; [L548] COND FALSE !(0 == ~n) [L550] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L550] ~head~0 := #t~malloc2; [L551] FCALL call write~int(~n, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L552] CALL call #t~ret3 := new_ll(~n - 1); [L546-L554] ~n := #in~n; [L548] COND TRUE 0 == ~n [L549] #res := { base: 0, offset: 0 }; [L552] RET call #t~ret3 := new_ll(~n - 1); [L552] FCALL call write~$Pointer$(#t~ret3, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 8); [L552] havoc #t~ret3; [L553] #res := ~head~0; [L574] RET call #t~ret9 := new_ll(~n~0); [L574] ~x~0 := #t~ret9; [L574] havoc #t~ret9; [L575] CALL call #t~ret10 := append(~x~0, ~x~0); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND FALSE !(~x == { base: 0, offset: 0 }) [L565] FCALL call #t~mem6 := read~$Pointer$({ base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] CALL call #t~ret7 := append(#t~mem6, ~y); [L561-L567] ~x := #in~x; [L561-L567] ~y := #in~y; [L563] COND TRUE ~x == { base: 0, offset: 0 } [L564] #res := ~y; [L565] RET call #t~ret7 := append(#t~mem6, ~y); [L565] FCALL call write~$Pointer$(#t~ret7, { base: ~x!base, offset: 4 + ~x!offset }, 8); [L565] havoc #t~mem6; [L565] havoc #t~ret7; [L566] #res := ~x; [L575] RET call #t~ret10 := append(~x~0, ~x~0); [L575] ~y~0 := #t~ret10; [L575] havoc #t~ret10; [L576] CALL call #t~ret11 := length(~y~0); [L570] int n = __VERIFIER_nondet_int(); [L571] COND FALSE !(n < 1) [L574] CALL, EXPR new_ll(n) [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n [L552] CALL, EXPR new_ll(n-1) [L548] COND TRUE n == 0 [L549] return ((void *)0); [L552] RET, EXPR new_ll(n-1) [L552] head->next = new_ll(n-1) [L553] return head; [L574] RET, EXPR new_ll(n) [L574] node_t* x = new_ll(n); [L575] CALL, EXPR append(x, x) [L563] COND FALSE !(x == ((void *)0)) [L565] EXPR x->next [L565] CALL, EXPR append(x->next, y) [L563] COND TRUE x == ((void *)0) [L564] return y; [L565] RET, EXPR append(x->next, y) [L565] x->next = append(x->next, y) [L566] return x; [L575] RET, EXPR append(x, x) [L575] node_t* y = append(x, x); [L576] CALL length(y) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [?] assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [?] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); [L555-L560] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [L557-L558] assume !(~xs.base == 0 && ~xs.offset == 0); [L559] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [L559] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L555-L560] ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; [L557-L558] assume !(~xs.base == 0 && ~xs.offset == 0); [L559] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~xs.base, 4 + ~xs.offset, 8); [L559] CALL call #t~ret5 := length(#t~mem4.base, #t~mem4.offset); [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L555-L560] ~xs := #in~xs; [L557] COND FALSE !(~xs == { base: 0, offset: 0 }) [L559] FCALL call #t~mem4 := read~$Pointer$({ base: ~xs!base, offset: 4 + ~xs!offset }, 8); [L559] CALL call #t~ret5 := length(#t~mem4); [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L570] int n = __VERIFIER_nondet_int(); [L571] COND FALSE !(n < 1) [L574] CALL, EXPR new_ll(n) [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n [L552] CALL, EXPR new_ll(n-1) [L548] COND TRUE n == 0 [L549] return ((void *)0); [L552] RET, EXPR new_ll(n-1) [L552] head->next = new_ll(n-1) [L553] return head; [L574] RET, EXPR new_ll(n) [L574] node_t* x = new_ll(n); [L575] CALL, EXPR append(x, x) [L563] COND FALSE !(x == ((void *)0)) [L565] EXPR x->next [L565] CALL, EXPR append(x->next, y) [L563] COND TRUE x == ((void *)0) [L564] return y; [L565] RET, EXPR append(x->next, y) [L565] x->next = append(x->next, y) [L566] return x; [L575] RET, EXPR append(x, x) [L575] node_t* y = append(x, x); [L576] CALL length(y) Loop: [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...