./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-linkedlists/nondet_ll_traverse-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_0072aa3a-dcf4-4c7e-a975-afbb9dccac6b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0072aa3a-dcf4-4c7e-a975-afbb9dccac6b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0072aa3a-dcf4-4c7e-a975-afbb9dccac6b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0072aa3a-dcf4-4c7e-a975-afbb9dccac6b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-linkedlists/nondet_ll_traverse-alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0072aa3a-dcf4-4c7e-a975-afbb9dccac6b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0072aa3a-dcf4-4c7e-a975-afbb9dccac6b/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 994980d673cadc47caecf39c679cfe156a013f75 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 00:49:25,049 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:49:25,049 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:49:25,055 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:49:25,056 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:49:25,056 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:49:25,057 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:49:25,058 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:49:25,059 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:49:25,060 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:49:25,061 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:49:25,061 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:49:25,061 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:49:25,062 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:49:25,062 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:49:25,063 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:49:25,063 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:49:25,064 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:49:25,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:49:25,067 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:49:25,067 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:49:25,068 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:49:25,070 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:49:25,070 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:49:25,070 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:49:25,070 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:49:25,071 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:49:25,071 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:49:25,072 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:49:25,072 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:49:25,072 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:49:25,073 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:49:25,073 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:49:25,073 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:49:25,074 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:49:25,074 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:49:25,074 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0072aa3a-dcf4-4c7e-a975-afbb9dccac6b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 00:49:25,085 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:49:25,085 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:49:25,086 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:49:25,086 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:49:25,086 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:49:25,086 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 00:49:25,086 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 00:49:25,086 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 00:49:25,087 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 00:49:25,087 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 00:49:25,087 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 00:49:25,087 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:49:25,087 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 00:49:25,087 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:49:25,087 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:49:25,087 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 00:49:25,088 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 00:49:25,088 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 00:49:25,088 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:49:25,088 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 00:49:25,088 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:49:25,088 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 00:49:25,088 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:49:25,089 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:49:25,089 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 00:49:25,089 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:49:25,089 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:49:25,089 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 00:49:25,090 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 00:49:25,090 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_0072aa3a-dcf4-4c7e-a975-afbb9dccac6b/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 -> 994980d673cadc47caecf39c679cfe156a013f75 [2018-11-23 00:49:25,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:49:25,122 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:49:25,124 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:49:25,126 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:49:25,126 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:49:25,126 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0072aa3a-dcf4-4c7e-a975-afbb9dccac6b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-linkedlists/nondet_ll_traverse-alloca_false-termination.c.i [2018-11-23 00:49:25,169 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0072aa3a-dcf4-4c7e-a975-afbb9dccac6b/bin-2019/uautomizer/data/9d1ec5c41/efb2eff26c4349d48517e59bb97f02b6/FLAGbfa4ce75d [2018-11-23 00:49:25,593 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:49:25,594 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0072aa3a-dcf4-4c7e-a975-afbb9dccac6b/sv-benchmarks/c/termination-memory-linkedlists/nondet_ll_traverse-alloca_false-termination.c.i [2018-11-23 00:49:25,600 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0072aa3a-dcf4-4c7e-a975-afbb9dccac6b/bin-2019/uautomizer/data/9d1ec5c41/efb2eff26c4349d48517e59bb97f02b6/FLAGbfa4ce75d [2018-11-23 00:49:25,609 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0072aa3a-dcf4-4c7e-a975-afbb9dccac6b/bin-2019/uautomizer/data/9d1ec5c41/efb2eff26c4349d48517e59bb97f02b6 [2018-11-23 00:49:25,611 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:49:25,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:49:25,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:49:25,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:49:25,614 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:49:25,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:49:25" (1/1) ... [2018-11-23 00:49:25,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@172b0922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:25, skipping insertion in model container [2018-11-23 00:49:25,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:49:25" (1/1) ... [2018-11-23 00:49:25,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:49:25,649 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:49:25,840 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:49:25,847 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:49:25,913 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:49:25,946 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:49:25,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:25 WrapperNode [2018-11-23 00:49:25,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:49:25,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:49:25,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:49:25,947 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:49:25,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:25" (1/1) ... [2018-11-23 00:49:25,966 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:25" (1/1) ... [2018-11-23 00:49:25,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:49:25,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:49:25,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:49:25,979 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:49:25,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:25" (1/1) ... [2018-11-23 00:49:25,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:25" (1/1) ... [2018-11-23 00:49:25,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:25" (1/1) ... [2018-11-23 00:49:25,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:25" (1/1) ... [2018-11-23 00:49:25,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:25" (1/1) ... [2018-11-23 00:49:25,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:25" (1/1) ... [2018-11-23 00:49:25,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:25" (1/1) ... [2018-11-23 00:49:25,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:49:25,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:49:25,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:49:25,998 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:49:25,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0072aa3a-dcf4-4c7e-a975-afbb9dccac6b/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 00:49:26,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:49:26,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 00:49:26,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 00:49:26,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 00:49:26,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:49:26,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:49:26,192 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:49:26,193 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-23 00:49:26,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:49:26 BoogieIcfgContainer [2018-11-23 00:49:26,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:49:26,193 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 00:49:26,194 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 00:49:26,196 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 00:49:26,196 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:49:26,196 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 12:49:25" (1/3) ... [2018-11-23 00:49:26,197 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16fc2c02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:49:26, skipping insertion in model container [2018-11-23 00:49:26,197 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:49:26,197 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:25" (2/3) ... [2018-11-23 00:49:26,197 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16fc2c02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:49:26, skipping insertion in model container [2018-11-23 00:49:26,197 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:49:26,197 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:49:26" (3/3) ... [2018-11-23 00:49:26,199 INFO L375 chiAutomizerObserver]: Analyzing ICFG nondet_ll_traverse-alloca_false-termination.c.i [2018-11-23 00:49:26,238 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:49:26,239 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 00:49:26,239 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 00:49:26,239 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 00:49:26,239 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:49:26,239 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:49:26,239 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 00:49:26,239 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:49:26,239 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 00:49:26,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 00:49:26,261 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2018-11-23 00:49:26,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:49:26,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:49:26,265 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 00:49:26,265 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 00:49:26,265 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 00:49:26,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 00:49:26,266 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2018-11-23 00:49:26,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:49:26,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:49:26,267 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 00:49:26,267 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 00:49:26,272 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12);init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset;call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4);init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; 13#L552-3true [2018-11-23 00:49:26,272 INFO L796 eck$LassoCheckResult]: Loop: 13#L552-3true assume !!(init_nondet_ll_~i~0 < init_nondet_ll_~n);call init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset := #Ultimate.alloc(12);init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset := init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset;call write~int(init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, 4);call write~$Pointer$(init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8);init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset; 10#L552-2true init_nondet_ll_#t~post3 := init_nondet_ll_~i~0;init_nondet_ll_~i~0 := 1 + init_nondet_ll_#t~post3;havoc init_nondet_ll_#t~post3; 13#L552-3true [2018-11-23 00:49:26,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:26,276 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 00:49:26,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:26,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:26,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:26,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:49:26,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:26,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:26,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-23 00:49:26,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:26,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:26,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:26,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:49:26,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:26,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:26,378 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-23 00:49:26,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:26,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:26,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:26,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:49:26,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:26,622 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2018-11-23 00:49:26,646 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 00:49:26,654 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 00:49:26,733 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 00:49:26,740 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 00:49:26,831 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 00:49:26,831 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:153, output treesize:155 [2018-11-23 00:49:27,014 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:49:27,014 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:49:27,014 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:49:27,015 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:49:27,015 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:49:27,015 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:49:27,015 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:49:27,015 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:49:27,015 INFO L131 ssoRankerPreferences]: Filename of dumped script: nondet_ll_traverse-alloca_false-termination.c.i_Iteration1_Lasso [2018-11-23 00:49:27,015 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:49:27,016 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:49:27,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:27,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:27,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:27,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:27,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:27,048 INFO 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 00:49:27,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:27,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:27,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:27,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:27,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:27,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:27,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:27,422 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:49:27,425 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:49:27,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:27,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:27,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:27,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:27,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:27,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:27,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:27,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:27,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,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 00:49:27,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:27,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:27,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:27,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,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 00:49:27,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:27,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:27,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:27,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,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 00:49:27,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:27,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:27,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:27,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:27,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:27,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:27,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:27,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:27,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:27,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:27,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:27,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:27,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:27,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:27,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:27,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,454 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:27,454 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:27,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:27,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:27,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:27,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:27,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:27,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:27,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:27,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:27,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,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 00:49:27,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:27,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:27,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:27,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:27,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:27,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:27,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:27,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:27,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:27,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:27,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:27,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:27,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:27,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:27,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:27,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:27,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:27,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:27,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,490 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:49:27,490 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:49:27,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,496 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 00:49:27,497 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:49:27,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:27,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:27,542 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:27,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,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 00:49:27,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:27,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:27,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:27,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:27,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:27,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:27,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:27,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:27,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:27,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:27,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:27,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:27,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:27,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:27,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:27,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:27,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:27,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:27,574 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 00:49:27,582 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 00:49:27,583 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 00:49:27,584 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 00:49:27,585 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 00:49:27,586 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 00:49:27,586 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_nondet_ll_~n, ULTIMATE.start_init_nondet_ll_~i~0) = 1*ULTIMATE.start_init_nondet_ll_~n - 1*ULTIMATE.start_init_nondet_ll_~i~0 Supporting invariants [] [2018-11-23 00:49:27,601 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 00:49:27,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:49:27,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:49:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:49:27,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:49:27,667 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 00:49:27,677 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 00:49:27,678 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 3 states. [2018-11-23 00:49:27,704 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 3 states. Result 30 states and 42 transitions. Complement of second has 7 states. [2018-11-23 00:49:27,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 00:49:27,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 00:49:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-11-23 00:49:27,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-23 00:49:27,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:49:27,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-23 00:49:27,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:49:27,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-23 00:49:27,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:49:27,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 42 transitions. [2018-11-23 00:49:27,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 00:49:27,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 9 states and 12 transitions. [2018-11-23 00:49:27,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 00:49:27,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 00:49:27,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2018-11-23 00:49:27,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:49:27,714 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-23 00:49:27,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2018-11-23 00:49:27,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-23 00:49:27,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 00:49:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-11-23 00:49:27,730 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-23 00:49:27,730 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-23 00:49:27,730 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 00:49:27,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2018-11-23 00:49:27,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 00:49:27,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:49:27,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:49:27,731 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 00:49:27,731 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 00:49:27,732 INFO L794 eck$LassoCheckResult]: Stem: 97#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 93#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12);init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset;call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4);init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; 94#L552-3 assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); 95#L552-4 assume !(0 != init_nondet_ll_#t~nondet5);havoc init_nondet_ll_#t~nondet5;call write~$Pointer$(0, 0, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); 96#L558-1 init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; 98#L562 main_#t~ret8.base, main_#t~ret8.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset;traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset;traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset;traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; 99#L567-2 [2018-11-23 00:49:27,732 INFO L796 eck$LassoCheckResult]: Loop: 99#L567-2 assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0);call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8);traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; 99#L567-2 [2018-11-23 00:49:27,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:27,732 INFO L82 PathProgramCache]: Analyzing trace with hash 889608977, now seen corresponding path program 1 times [2018-11-23 00:49:27,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:27,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:27,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:27,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:49:27,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:27,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:27,747 INFO L82 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 1 times [2018-11-23 00:49:27,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:27,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:27,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:27,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:49:27,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:27,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:27,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1808074544, now seen corresponding path program 1 times [2018-11-23 00:49:27,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:27,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:27,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:27,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:49:27,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:28,066 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 107 [2018-11-23 00:49:28,069 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 00:49:28,074 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 00:49:28,153 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 00:49:28,157 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 00:49:28,220 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 00:49:28,220 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:177, output treesize:153 [2018-11-23 00:49:28,283 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:49:28,283 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:49:28,283 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:49:28,283 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:49:28,283 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:49:28,283 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:49:28,283 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:49:28,283 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:49:28,283 INFO L131 ssoRankerPreferences]: Filename of dumped script: nondet_ll_traverse-alloca_false-termination.c.i_Iteration2_Lasso [2018-11-23 00:49:28,283 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:49:28,284 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:49:28,286 INFO 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 00:49:28,290 INFO 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 00:49:28,291 INFO 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 00:49:28,293 INFO 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 00:49:28,294 INFO 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 00:49:28,296 INFO 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 00:49:28,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 00:49:28,384 INFO 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 00:49:28,385 INFO 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 00:49:28,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:28,387 INFO 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 00:49:28,389 INFO 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 00:49:28,390 INFO 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 00:49:28,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:49:28,392 INFO 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 00:49:28,393 INFO 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 00:49:28,402 INFO 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 00:49:28,729 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-23 00:49:28,836 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:49:28,836 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:49:28,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:28,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:28,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:28,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:28,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:28,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:28,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:28,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:28,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:28,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:28,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:28,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:28,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:28,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:28,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:28,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:28,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:28,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:28,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:28,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:28,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:28,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:28,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:28,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:28,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:28,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:28,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:28,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 00:49:28,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:28,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:28,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:28,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:28,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:28,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:28,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:28,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:28,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:28,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:28,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:28,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:28,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:28,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:28,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:28,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:28,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 00:49:28,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:28,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:28,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:28,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:28,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:28,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:28,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:28,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:28,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:28,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:28,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:28,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:28,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:28,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:28,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:28,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:28,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 00:49:28,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:28,852 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:49:28,852 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 00:49:28,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:28,886 INFO L402 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2018-11-23 00:49:28,886 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-23 00:49:29,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:29,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:29,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:29,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:29,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:29,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:29,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:29,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:29,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:29,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:29,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:29,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:29,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:29,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:29,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:29,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:29,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:29,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:29,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:29,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:29,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:29,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:29,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:29,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:29,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:29,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:49:29,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:49:29,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:49:29,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,035 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 00:49:29,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 00:49:29,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,036 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,036 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:29,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,038 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,038 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:29,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,039 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,039 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:29,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,041 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,041 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:29,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,042 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,043 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:49:29,043 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:49:29,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,044 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,045 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:49:29,045 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:49:29,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,049 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,050 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:29,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,051 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:49:29,051 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 00:49:29,051 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,088 INFO L402 nArgumentSynthesizer]: We have 84 Motzkin's Theorem applications. [2018-11-23 00:49:29,088 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-23 00:49:29,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,254 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,255 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:49:29,255 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:49:29,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,257 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,257 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:29,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,258 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,258 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:29,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,260 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,260 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:29,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,261 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,261 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:29,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,262 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,263 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:49:29,263 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:49:29,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,265 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,265 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:29,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,266 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,267 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:49:29,267 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:49:29,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,269 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,269 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:29,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,270 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,271 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:29,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,272 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,273 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:49:29,273 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:49:29,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,277 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,277 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:29,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,278 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 00:49:29,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,279 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:29,279 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:29,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,280 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:29,280 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:29,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,282 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:29,282 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:29,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,283 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:29,283 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:29,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,285 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:29,285 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:49:29,285 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:49:29,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,288 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:29,289 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:49:29,289 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:49:29,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,294 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:29,294 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:29,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,295 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:49:29,296 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 00:49:29,296 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:29,345 INFO L402 nArgumentSynthesizer]: We have 112 Motzkin's Theorem applications. [2018-11-23 00:49:29,345 INFO L403 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2018-11-23 00:49:29,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,582 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:29,583 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:49:29,583 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:49:29,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,687 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:29,687 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:29,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,689 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:29,689 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:29,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,690 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:29,690 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:29,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,692 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:29,692 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:29,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,693 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:29,694 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:49:29,694 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:49:29,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,697 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:29,697 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:29,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,698 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:29,699 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:49:29,699 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:49:29,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,701 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:29,701 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:29,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,703 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:29,703 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:29,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,704 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:29,705 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:49:29,705 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:49:29,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,710 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:29,711 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:29,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,711 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 00:49:29,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,712 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:29,712 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:29,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,714 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:29,714 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:29,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,715 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:29,715 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:29,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,717 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:29,717 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:29,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,718 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:29,719 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:49:29,719 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:49:29,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,722 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:29,723 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:49:29,723 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:49:29,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,729 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:29,729 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:29,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,731 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:49:29,731 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 00:49:29,731 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:29,770 INFO L402 nArgumentSynthesizer]: We have 140 Motzkin's Theorem applications. [2018-11-23 00:49:29,770 INFO L403 nArgumentSynthesizer]: A total of 20 supporting invariants were added. [2018-11-23 00:49:29,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,951 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:29,951 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:49:29,951 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:49:29,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,954 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:29,954 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:29,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,956 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:29,956 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:29,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,957 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:29,958 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:29,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,959 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:29,959 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:29,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,961 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:29,961 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:49:29,962 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:49:29,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,964 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:29,964 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:29,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,966 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:29,966 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:49:29,967 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:49:29,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,969 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:29,969 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:29,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,971 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:29,971 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:29,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,972 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:29,974 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:49:29,974 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:49:29,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:49:29,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,980 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:29,980 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:29,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,981 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 00:49:29,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 00:49:29,981 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:29,981 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:29,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,982 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,982 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:29,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,983 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:29,983 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:29,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,984 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,984 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:29,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,985 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:29,985 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:29,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,986 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,986 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:29,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,987 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:29,987 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:29,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:29,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,988 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,988 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:29,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:29,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:29,989 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:29,989 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:29,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,990 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,990 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:49:29,990 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:49:29,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,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 00:49:29,993 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:29,993 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:29,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:29,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:29,994 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:29,995 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:49:29,995 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:49:29,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:29,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,000 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,000 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,000 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:30,000 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:30,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,002 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,002 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,002 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:49:30,002 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 00:49:30,002 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:30,038 INFO L402 nArgumentSynthesizer]: We have 84 Motzkin's Theorem applications. [2018-11-23 00:49:30,038 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-23 00:49:30,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,148 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,148 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,148 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:30,149 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:49:30,149 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:49:30,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,152 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,152 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,152 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:30,152 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:30,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,154 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,154 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,154 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:30,155 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:30,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,156 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,156 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,156 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:30,157 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:30,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,158 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,158 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,158 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:30,159 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:30,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,160 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,160 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,160 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:30,161 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:49:30,161 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:49:30,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,163 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,164 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,164 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:30,164 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:30,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,165 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,165 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,166 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:30,166 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:49:30,166 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:49:30,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,169 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,169 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,169 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:30,170 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:30,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,171 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,171 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,171 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:30,172 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:30,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,173 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,173 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,173 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:30,174 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:49:30,174 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:49:30,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,179 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,179 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,179 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:49:30,180 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:49:30,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,180 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 00:49:30,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,181 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,181 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:49:30,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,181 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,182 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:30,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,183 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,183 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:49:30,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,184 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,184 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:30,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,186 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,186 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:49:30,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,186 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,187 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:30,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,188 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,188 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:49:30,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,189 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,189 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:30,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,191 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,191 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:49:30,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,191 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,192 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:49:30,192 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:49:30,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,195 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,195 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:49:30,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,195 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,196 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:49:30,197 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:49:30,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,203 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,203 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:49:30,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,203 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,204 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:30,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,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 00:49:30,206 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,206 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:49:30,206 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:49:30,206 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 00:49:30,206 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,258 INFO L402 nArgumentSynthesizer]: We have 112 Motzkin's Theorem applications. [2018-11-23 00:49:30,258 INFO L403 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2018-11-23 00:49:30,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,536 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,536 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:49:30,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,536 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,537 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:49:30,537 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:49:30,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,540 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,540 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:49:30,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,540 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,541 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:30,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,543 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,543 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:49:30,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,543 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,543 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:30,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,545 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,545 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:49:30,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,545 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,546 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:30,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,547 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,547 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:49:30,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,548 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,548 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:30,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,550 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,550 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:49:30,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,550 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,551 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:49:30,551 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:49:30,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,554 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,554 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:49:30,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,555 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,555 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:30,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,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 00:49:30,557 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,557 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:49:30,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,557 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,558 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:49:30,558 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:49:30,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,561 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:49:30,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,562 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,562 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:30,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,564 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,564 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:49:30,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,564 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,565 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:30,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,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 00:49:30,566 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,566 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:49:30,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,567 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,568 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:49:30,568 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:49:30,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,575 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,575 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:49:30,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,575 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,576 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:30,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,577 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 00:49:30,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,577 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,577 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:30,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,578 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:30,578 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:30,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,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 00:49:30,580 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,580 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:30,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,580 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:30,581 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:30,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,582 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,582 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:30,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,583 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:30,583 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:30,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,585 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,585 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:30,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,585 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:30,586 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:30,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,587 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,587 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:30,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,588 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:30,589 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:49:30,589 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:49:30,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,594 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,594 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:30,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,594 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:30,597 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:49:30,597 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:49:30,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,605 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,605 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:30,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,606 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:30,607 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:30,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,608 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,608 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:30,608 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:49:30,609 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 00:49:30,609 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:30,669 INFO L402 nArgumentSynthesizer]: We have 140 Motzkin's Theorem applications. [2018-11-23 00:49:30,669 INFO L403 nArgumentSynthesizer]: A total of 20 supporting invariants were added. [2018-11-23 00:49:30,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,882 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,882 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:30,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,883 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:30,884 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:49:30,884 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:49:30,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,889 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,889 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:30,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,889 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:30,890 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:30,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,891 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,891 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:30,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,892 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:30,893 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:30,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,894 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,894 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:30,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,894 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:30,895 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:30,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,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 00:49:30,897 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,897 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:30,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,897 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:30,898 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:30,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,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 00:49:30,899 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,899 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:30,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,900 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:30,901 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:49:30,901 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:49:30,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,906 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,906 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:30,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,907 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:30,907 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:30,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,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 00:49:30,909 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,909 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:30,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,909 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:30,911 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:49:30,911 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:49:30,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,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 00:49:30,916 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,916 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:30,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,916 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:30,917 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:30,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,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 00:49:30,918 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,918 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:30,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,919 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:30,920 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:30,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,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 00:49:30,921 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,921 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:30,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,922 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:30,924 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:49:30,924 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:49:30,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,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 00:49:30,933 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,933 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:30,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,934 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:49:30,934 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:49:30,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,935 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 00:49:30,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 00:49:30,936 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,936 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,937 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,937 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:30,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,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 00:49:30,939 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,939 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,939 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,939 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:30,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,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 00:49:30,941 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,941 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,942 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,942 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:30,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,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 00:49:30,944 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,944 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,944 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,944 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:30,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,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 00:49:30,946 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,946 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,947 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,947 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:49:30,947 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:49:30,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,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 00:49:30,950 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,950 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,951 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,952 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:49:30,952 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:49:30,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:30,960 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,960 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:30,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:30,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:30,961 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:30,961 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:30,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:30,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:30,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 00:49:30,963 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:30,963 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:30,963 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:49:30,964 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 00:49:30,964 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:31,016 INFO L402 nArgumentSynthesizer]: We have 112 Motzkin's Theorem applications. [2018-11-23 00:49:31,016 INFO L403 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2018-11-23 00:49:31,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:31,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:31,603 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:31,603 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:31,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:31,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:31,604 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:31,604 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:49:31,604 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:49:31,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:31,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:31,607 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:31,608 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:31,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:31,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:31,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:31,608 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:31,608 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:31,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:31,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:31,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:31,610 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:31,610 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:31,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:31,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:31,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:31,611 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:31,611 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:31,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:31,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:31,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:31,613 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:31,613 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:31,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:31,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:31,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:31,613 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:31,613 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:31,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:31,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:31,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:31,615 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:31,615 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:31,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:31,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:31,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:31,616 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:31,616 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:31,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:31,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:31,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:31,618 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:31,618 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:31,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:31,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:31,618 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:31,619 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:49:31,619 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:49:31,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:31,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:31,622 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:31,622 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:31,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:31,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:31,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:31,622 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:31,622 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:31,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:31,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:31,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:31,624 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:31,624 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:31,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:31,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:31,624 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:31,625 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:49:31,625 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:49:31,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:31,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:31,628 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:31,628 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:31,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:31,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:31,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:31,628 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:31,629 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:31,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:31,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:31,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:31,630 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:31,630 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:31,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:31,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:31,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:31,631 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:31,631 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:31,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:31,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:31,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:31,633 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:31,633 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:31,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:31,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:31,633 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:31,634 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:49:31,635 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:49:31,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:31,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:31,639 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:31,639 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:49:31,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:31,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:31,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:31,640 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:49:31,640 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:49:31,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:31,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:31,641 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 00:49:31,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:31,642 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:31,642 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:31,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:31,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:31,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:31,642 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:49:31,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:31,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:31,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:31,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 00:49:31,645 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:31,645 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:31,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:31,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:31,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:31,645 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:49:31,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:31,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:31,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:31,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 00:49:31,648 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:31,648 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:31,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:31,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:31,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:31,648 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:49:31,649 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:31,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:31,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:31,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 00:49:31,651 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:31,651 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:31,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:31,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:31,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:31,651 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:49:31,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:31,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:31,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:31,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:31,654 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:31,654 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:31,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:31,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:31,654 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:49:31,655 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 00:49:31,655 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 00:49:31,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:31,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:31,659 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:31,659 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:31,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:31,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:31,659 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:49:31,661 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 00:49:31,661 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 00:49:31,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:31,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:31,674 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:31,674 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:31,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:31,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:31,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:31,674 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:49:31,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:31,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:31,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:31,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:31,677 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:31,677 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:31,677 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:49:31,678 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 00:49:31,678 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:49:31,750 INFO L402 nArgumentSynthesizer]: We have 168 Motzkin's Theorem applications. [2018-11-23 00:49:31,750 INFO L403 nArgumentSynthesizer]: A total of 24 supporting invariants were added. [2018-11-23 00:49:32,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:32,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:32,690 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:32,690 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:32,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:32,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:32,690 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:49:32,691 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 00:49:32,691 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 00:49:32,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:32,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:32,695 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:32,695 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:32,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:32,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:32,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:32,696 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:49:32,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:32,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:32,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:32,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:32,699 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:32,699 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:32,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:32,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:32,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:32,699 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:49:32,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:32,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:32,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:32,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:32,702 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:32,702 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:32,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:32,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:32,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:32,702 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:49:32,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:32,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:32,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:32,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:32,705 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:32,705 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:32,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:32,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:32,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:32,705 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:49:32,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:32,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:32,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:32,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:32,708 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:32,708 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:32,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:32,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:32,709 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:49:32,709 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 00:49:32,710 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 00:49:32,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:32,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:32,713 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:32,713 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:32,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:32,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:32,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:32,713 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:49:32,714 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:32,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:32,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:32,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:32,716 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:32,716 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:32,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:32,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:32,716 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:49:32,717 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 00:49:32,717 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 00:49:32,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:32,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:32,720 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:32,721 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:32,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:32,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:32,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:32,721 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:49:32,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:32,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:32,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:32,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:32,723 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:32,723 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:32,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:32,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:32,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:32,724 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:49:32,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:32,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:32,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:32,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:49:32,726 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:32,726 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:32,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:32,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:32,727 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:49:32,728 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 00:49:32,728 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 00:49:32,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:32,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 00:49:32,734 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:49:32,734 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:49:32,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:49:32,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:49:32,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:49:32,734 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:49:32,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:49:32,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:49:32,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:49:32,736 INFO L488 BuchiCegarLoop]: Result of lasso check was UNKNOWN. I will concatenate loop to stem and try again. [2018-11-23 00:49:32,737 INFO L794 eck$LassoCheckResult]: Stem: 97#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 93#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12);init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset;call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4);init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; 94#L552-3 assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); 95#L552-4 assume !(0 != init_nondet_ll_#t~nondet5);havoc init_nondet_ll_#t~nondet5;call write~$Pointer$(0, 0, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); 96#L558-1 init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; 98#L562 main_#t~ret8.base, main_#t~ret8.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset;traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset;traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset;traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; 99#L567-2 assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0);call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8);traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; 99#L567-2 [2018-11-23 00:49:32,737 INFO L796 eck$LassoCheckResult]: Loop: 99#L567-2 assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0);call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8);traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; 99#L567-2 [2018-11-23 00:49:32,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:32,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1808074544, now seen corresponding path program 2 times [2018-11-23 00:49:32,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:32,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:32,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:32,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:49:32,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:32,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:32,748 INFO L82 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 2 times [2018-11-23 00:49:32,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:32,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:32,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:32,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:49:32,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:32,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:32,752 INFO L82 PathProgramCache]: Analyzing trace with hash 215736049, now seen corresponding path program 3 times [2018-11-23 00:49:32,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:32,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:32,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:32,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:49:32,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:49:32,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:49:32,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:49:32,879 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0072aa3a-dcf4-4c7e-a975-afbb9dccac6b/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 00:49:32,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 00:49:32,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 00:49:32,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:49:32,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:49:32,940 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 00:49:32,942 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 00:49:32,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:49:32,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:49:32,957 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 00:49:32,961 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 00:49:32,961 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:49:32,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:49:32,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:49:32,968 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-23 00:49:32,985 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 00:49:32,987 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 00:49:32,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:49:32,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:49:32,995 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 00:49:32,997 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 00:49:32,997 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:49:32,999 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:49:33,002 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 00:49:33,002 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 00:49:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:49:33,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:49:33,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 00:49:33,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 00:49:33,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:49:33,049 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-23 00:49:33,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:49:33,148 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-11-23 00:49:33,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 00:49:33,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2018-11-23 00:49:33,150 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-11-23 00:49:33,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 16 transitions. [2018-11-23 00:49:33,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 00:49:33,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 00:49:33,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2018-11-23 00:49:33,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:49:33,151 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-23 00:49:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2018-11-23 00:49:33,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-11-23 00:49:33,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 00:49:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-23 00:49:33,152 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 00:49:33,152 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 00:49:33,152 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 00:49:33,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-23 00:49:33,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 00:49:33,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:49:33,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:49:33,153 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 00:49:33,153 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 00:49:33,153 INFO L794 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 167#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12);init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset;call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4);init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; 168#L552-3 assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); 169#L552-4 assume 0 != init_nondet_ll_#t~nondet5;havoc init_nondet_ll_#t~nondet5;call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); 170#L558-1 init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; 172#L562 main_#t~ret8.base, main_#t~ret8.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset;traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset;traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset;traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; 173#L567-2 [2018-11-23 00:49:33,153 INFO L796 eck$LassoCheckResult]: Loop: 173#L567-2 assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0);call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8);traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; 173#L567-2 [2018-11-23 00:49:33,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:33,153 INFO L82 PathProgramCache]: Analyzing trace with hash 889607055, now seen corresponding path program 1 times [2018-11-23 00:49:33,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:33,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:33,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:33,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:49:33,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:33,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:33,167 INFO L82 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 3 times [2018-11-23 00:49:33,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:33,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:33,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:33,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:49:33,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:33,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:49:33,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1808014962, now seen corresponding path program 1 times [2018-11-23 00:49:33,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:49:33,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:49:33,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:33,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:49:33,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:49:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:49:33,448 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 108 [2018-11-23 00:49:33,451 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 00:49:33,455 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 00:49:33,529 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 00:49:33,533 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 00:49:33,597 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 00:49:33,598 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:177, output treesize:153 ----- 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~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12);init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset;call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4);init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; [?] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [?] assume 0 != init_nondet_ll_#t~nondet5;havoc init_nondet_ll_#t~nondet5;call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [?] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [?] main_#t~ret8.base, main_#t~ret8.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset;traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset;traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset;traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_~n~0, main_~head~1.base, main_~head~1.offset; [L573] main_~n~0 := main_#t~nondet7; [L573] havoc main_#t~nondet7; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L549] call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; [L550] call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4); [L551] init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [L558-L561] assume 0 != init_nondet_ll_#t~nondet5; [L558] havoc init_nondet_ll_#t~nondet5; [L559] call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [L562] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L574] main_#t~ret8.base, main_#t~ret8.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset; [L574] havoc main_#t~ret8.base, main_#t~ret8.offset; [L575] traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset; [L575] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset; [L564-L570] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L566] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.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~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_~n~0, main_~head~1.base, main_~head~1.offset; [L573] main_~n~0 := main_#t~nondet7; [L573] havoc main_#t~nondet7; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L549] call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; [L550] call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4); [L551] init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [L558-L561] assume 0 != init_nondet_ll_#t~nondet5; [L558] havoc init_nondet_ll_#t~nondet5; [L559] call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [L562] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L574] main_#t~ret8.base, main_#t~ret8.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset; [L574] havoc main_#t~ret8.base, main_#t~ret8.offset; [L575] traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset; [L575] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset; [L564-L570] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L566] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8, main_~n~0, main_~head~1; [L573] main_~n~0 := main_#t~nondet7; [L573] havoc main_#t~nondet7; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res; [L574] havoc init_nondet_ll_#t~malloc2, init_nondet_ll_#t~malloc4, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0, init_nondet_ll_~curr~0; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0; [L549] FCALL call init_nondet_ll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0 := init_nondet_ll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_nondet_ll_~curr~0!base, offset: init_nondet_ll_~curr~0!offset }, 4); [L551] init_nondet_ll_~head~0 := init_nondet_ll_~curr~0; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] COND TRUE !(init_nondet_ll_~i~0 < init_nondet_ll_~n) [L558-L561] COND TRUE 0 != init_nondet_ll_#t~nondet5 [L558] havoc init_nondet_ll_#t~nondet5; [L559] FCALL call write~$Pointer$(init_nondet_ll_~head~0, { base: init_nondet_ll_~curr~0!base, offset: 4 + init_nondet_ll_~curr~0!offset }, 8); [L562] init_nondet_ll_#res := init_nondet_ll_~head~0; [L574] main_#t~ret8 := init_nondet_ll_#res; [L574] main_~head~1 := main_#t~ret8; [L574] havoc main_#t~ret8; [L575] traverse_#in~head := main_~head~1; [L575] havoc traverse_#t~mem6, traverse_~head, traverse_~curr~1; [L564-L570] traverse_~head := traverse_#in~head; [L566] traverse_~curr~1 := traverse_~head; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8, main_~n~0, main_~head~1; [L573] main_~n~0 := main_#t~nondet7; [L573] havoc main_#t~nondet7; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res; [L574] havoc init_nondet_ll_#t~malloc2, init_nondet_ll_#t~malloc4, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0, init_nondet_ll_~curr~0; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0; [L549] FCALL call init_nondet_ll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0 := init_nondet_ll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_nondet_ll_~curr~0!base, offset: init_nondet_ll_~curr~0!offset }, 4); [L551] init_nondet_ll_~head~0 := init_nondet_ll_~curr~0; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] COND TRUE !(init_nondet_ll_~i~0 < init_nondet_ll_~n) [L558-L561] COND TRUE 0 != init_nondet_ll_#t~nondet5 [L558] havoc init_nondet_ll_#t~nondet5; [L559] FCALL call write~$Pointer$(init_nondet_ll_~head~0, { base: init_nondet_ll_~curr~0!base, offset: 4 + init_nondet_ll_~curr~0!offset }, 8); [L562] init_nondet_ll_#res := init_nondet_ll_~head~0; [L574] main_#t~ret8 := init_nondet_ll_#res; [L574] main_~head~1 := main_#t~ret8; [L574] havoc main_#t~ret8; [L575] traverse_#in~head := main_~head~1; [L575] havoc traverse_#t~mem6, traverse_~head, traverse_~curr~1; [L564-L570] traverse_~head := traverse_#in~head; [L566] traverse_~curr~1 := traverse_~head; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet7; [L573] havoc #t~nondet7; [L546-L563] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558-L561] COND TRUE 0 != #t~nondet5 [L558] havoc #t~nondet5; [L559] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L562] #res := ~head~0; [L574] ~head~1 := #t~ret8; [L574] havoc #t~ret8; [L564-L570] ~head := #in~head; [L566] ~curr~1 := ~head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet7; [L573] havoc #t~nondet7; [L546-L563] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558-L561] COND TRUE 0 != #t~nondet5 [L558] havoc #t~nondet5; [L559] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L562] #res := ~head~0; [L574] ~head~1 := #t~ret8; [L574] havoc #t~ret8; [L564-L570] ~head := #in~head; [L566] ~curr~1 := ~head; [L573] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] COND TRUE __VERIFIER_nondet_int() [L559] curr->next = head [L562] return head; [L574] node_t* head = init_nondet_ll(n); [L566] node_t* curr = head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0);call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8);traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; [L567-L569] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0); [L568] call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8); [L568] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset; [L568] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L567-L569] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0); [L568] call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8); [L568] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset; [L568] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; [L567-L569] COND FALSE !(!(traverse_~curr~1 != { base: 0, offset: 0 })) [L568] FCALL call traverse_#t~mem6 := read~$Pointer$({ base: traverse_~curr~1!base, offset: 4 + traverse_~curr~1!offset }, 8); [L568] traverse_~curr~1 := traverse_#t~mem6; [L568] havoc traverse_#t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L567-L569] COND FALSE !(!(traverse_~curr~1 != { base: 0, offset: 0 })) [L568] FCALL call traverse_#t~mem6 := read~$Pointer$({ base: traverse_~curr~1!base, offset: 4 + traverse_~curr~1!offset }, 8); [L568] traverse_~curr~1 := traverse_#t~mem6; [L568] havoc traverse_#t~mem6; [L567-L569] COND FALSE !(!(~curr~1 != { base: 0, offset: 0 })) [L568] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L568] ~curr~1 := #t~mem6; [L568] havoc #t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L567-L569] COND FALSE !(!(~curr~1 != { base: 0, offset: 0 })) [L568] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L568] ~curr~1 := #t~mem6; [L568] havoc #t~mem6; [L567] COND TRUE curr != ((void *)0) [L568] EXPR curr->next [L568] curr = curr->next ----- [2018-11-23 00:49:33,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 12:49:33 BoogieIcfgContainer [2018-11-23 00:49:33,690 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 00:49:33,690 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:49:33,690 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:49:33,690 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:49:33,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:49:26" (3/4) ... [2018-11-23 00:49:33,693 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~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12);init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset;call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4);init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; [?] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [?] assume 0 != init_nondet_ll_#t~nondet5;havoc init_nondet_ll_#t~nondet5;call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [?] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [?] main_#t~ret8.base, main_#t~ret8.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset;traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset;traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset;traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_~n~0, main_~head~1.base, main_~head~1.offset; [L573] main_~n~0 := main_#t~nondet7; [L573] havoc main_#t~nondet7; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L549] call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; [L550] call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4); [L551] init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [L558-L561] assume 0 != init_nondet_ll_#t~nondet5; [L558] havoc init_nondet_ll_#t~nondet5; [L559] call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [L562] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L574] main_#t~ret8.base, main_#t~ret8.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset; [L574] havoc main_#t~ret8.base, main_#t~ret8.offset; [L575] traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset; [L575] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset; [L564-L570] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L566] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.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~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_~n~0, main_~head~1.base, main_~head~1.offset; [L573] main_~n~0 := main_#t~nondet7; [L573] havoc main_#t~nondet7; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L549] call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; [L550] call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4); [L551] init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [L558-L561] assume 0 != init_nondet_ll_#t~nondet5; [L558] havoc init_nondet_ll_#t~nondet5; [L559] call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [L562] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L574] main_#t~ret8.base, main_#t~ret8.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset; [L574] havoc main_#t~ret8.base, main_#t~ret8.offset; [L575] traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset; [L575] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset; [L564-L570] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L566] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8, main_~n~0, main_~head~1; [L573] main_~n~0 := main_#t~nondet7; [L573] havoc main_#t~nondet7; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res; [L574] havoc init_nondet_ll_#t~malloc2, init_nondet_ll_#t~malloc4, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0, init_nondet_ll_~curr~0; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0; [L549] FCALL call init_nondet_ll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0 := init_nondet_ll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_nondet_ll_~curr~0!base, offset: init_nondet_ll_~curr~0!offset }, 4); [L551] init_nondet_ll_~head~0 := init_nondet_ll_~curr~0; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] COND TRUE !(init_nondet_ll_~i~0 < init_nondet_ll_~n) [L558-L561] COND TRUE 0 != init_nondet_ll_#t~nondet5 [L558] havoc init_nondet_ll_#t~nondet5; [L559] FCALL call write~$Pointer$(init_nondet_ll_~head~0, { base: init_nondet_ll_~curr~0!base, offset: 4 + init_nondet_ll_~curr~0!offset }, 8); [L562] init_nondet_ll_#res := init_nondet_ll_~head~0; [L574] main_#t~ret8 := init_nondet_ll_#res; [L574] main_~head~1 := main_#t~ret8; [L574] havoc main_#t~ret8; [L575] traverse_#in~head := main_~head~1; [L575] havoc traverse_#t~mem6, traverse_~head, traverse_~curr~1; [L564-L570] traverse_~head := traverse_#in~head; [L566] traverse_~curr~1 := traverse_~head; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8, main_~n~0, main_~head~1; [L573] main_~n~0 := main_#t~nondet7; [L573] havoc main_#t~nondet7; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res; [L574] havoc init_nondet_ll_#t~malloc2, init_nondet_ll_#t~malloc4, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0, init_nondet_ll_~curr~0; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0; [L549] FCALL call init_nondet_ll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0 := init_nondet_ll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_nondet_ll_~curr~0!base, offset: init_nondet_ll_~curr~0!offset }, 4); [L551] init_nondet_ll_~head~0 := init_nondet_ll_~curr~0; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] COND TRUE !(init_nondet_ll_~i~0 < init_nondet_ll_~n) [L558-L561] COND TRUE 0 != init_nondet_ll_#t~nondet5 [L558] havoc init_nondet_ll_#t~nondet5; [L559] FCALL call write~$Pointer$(init_nondet_ll_~head~0, { base: init_nondet_ll_~curr~0!base, offset: 4 + init_nondet_ll_~curr~0!offset }, 8); [L562] init_nondet_ll_#res := init_nondet_ll_~head~0; [L574] main_#t~ret8 := init_nondet_ll_#res; [L574] main_~head~1 := main_#t~ret8; [L574] havoc main_#t~ret8; [L575] traverse_#in~head := main_~head~1; [L575] havoc traverse_#t~mem6, traverse_~head, traverse_~curr~1; [L564-L570] traverse_~head := traverse_#in~head; [L566] traverse_~curr~1 := traverse_~head; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet7; [L573] havoc #t~nondet7; [L546-L563] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558-L561] COND TRUE 0 != #t~nondet5 [L558] havoc #t~nondet5; [L559] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L562] #res := ~head~0; [L574] ~head~1 := #t~ret8; [L574] havoc #t~ret8; [L564-L570] ~head := #in~head; [L566] ~curr~1 := ~head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet7; [L573] havoc #t~nondet7; [L546-L563] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558-L561] COND TRUE 0 != #t~nondet5 [L558] havoc #t~nondet5; [L559] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L562] #res := ~head~0; [L574] ~head~1 := #t~ret8; [L574] havoc #t~ret8; [L564-L570] ~head := #in~head; [L566] ~curr~1 := ~head; [L573] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] COND TRUE __VERIFIER_nondet_int() [L559] curr->next = head [L562] return head; [L574] node_t* head = init_nondet_ll(n); [L566] node_t* curr = head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0);call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8);traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; [L567-L569] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0); [L568] call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8); [L568] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset; [L568] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L567-L569] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0); [L568] call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8); [L568] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset; [L568] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; [L567-L569] COND FALSE !(!(traverse_~curr~1 != { base: 0, offset: 0 })) [L568] FCALL call traverse_#t~mem6 := read~$Pointer$({ base: traverse_~curr~1!base, offset: 4 + traverse_~curr~1!offset }, 8); [L568] traverse_~curr~1 := traverse_#t~mem6; [L568] havoc traverse_#t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L567-L569] COND FALSE !(!(traverse_~curr~1 != { base: 0, offset: 0 })) [L568] FCALL call traverse_#t~mem6 := read~$Pointer$({ base: traverse_~curr~1!base, offset: 4 + traverse_~curr~1!offset }, 8); [L568] traverse_~curr~1 := traverse_#t~mem6; [L568] havoc traverse_#t~mem6; [L567-L569] COND FALSE !(!(~curr~1 != { base: 0, offset: 0 })) [L568] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L568] ~curr~1 := #t~mem6; [L568] havoc #t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L567-L569] COND FALSE !(!(~curr~1 != { base: 0, offset: 0 })) [L568] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L568] ~curr~1 := #t~mem6; [L568] havoc #t~mem6; [L567] COND TRUE curr != ((void *)0) [L568] EXPR curr->next [L568] curr = curr->next ----- [2018-11-23 00:49:33,776 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0072aa3a-dcf4-4c7e-a975-afbb9dccac6b/bin-2019/uautomizer/witness.graphml [2018-11-23 00:49:33,776 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:49:33,777 INFO L168 Benchmark]: Toolchain (without parser) took 8165.98 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 716.2 MB). Free memory was 957.6 MB in the beginning and 1.3 GB in the end (delta: -311.8 MB). Peak memory consumption was 404.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:49:33,778 INFO L168 Benchmark]: CDTParser took 0.14 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 00:49:33,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 00:49:33,778 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.06 ms. Allocated memory is still 1.1 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 00:49:33,779 INFO L168 Benchmark]: Boogie Preprocessor took 19.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:49:33,779 INFO L168 Benchmark]: RCFGBuilder took 195.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:49:33,779 INFO L168 Benchmark]: BuchiAutomizer took 7496.30 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 596.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -188.3 MB). Peak memory consumption was 407.9 MB. Max. memory is 11.5 GB. [2018-11-23 00:49:33,780 INFO L168 Benchmark]: Witness Printer took 86.49 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 00:49:33,782 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.14 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 334.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.06 ms. Allocated memory is still 1.1 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 19.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 195.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7496.30 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 596.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -188.3 MB). Peak memory consumption was 407.9 MB. Max. memory is 11.5 GB. * Witness Printer took 86.49 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. The remainder module has 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 7.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 17 SDtfs, 19 SDslu, 37 SDs, 0 SdLazy, 47 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital254 mio100 ax100 hnf100 lsp97 ukn41 mio100 lsp24 div100 bol100 ite100 ukn100 eq196 hnf87 smp100 dnf162 smp100 tf100 neg94 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 49ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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: 567]: 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 {NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4cf6ad95=0, curr=2, \result=0, head=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2fe4b6ad=0, next_node=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f4b0bb1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b4b763d=0, \old(n)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f4b0bb1=2, \result=0, head=0, head=2, i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4cf6ad95=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48b3fb2f=0, \result=2, head=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@3b9d3bc2=0, n=0, next_node=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@36a1d443=0, head=0, head=2, curr=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48b3fb2f=0, NULL=0, head=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b4b763d=0, curr=0, head=0, curr=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 567]: 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~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12);init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset;call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4);init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; [?] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [?] assume 0 != init_nondet_ll_#t~nondet5;havoc init_nondet_ll_#t~nondet5;call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [?] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [?] main_#t~ret8.base, main_#t~ret8.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset;traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset;traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset;traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_~n~0, main_~head~1.base, main_~head~1.offset; [L573] main_~n~0 := main_#t~nondet7; [L573] havoc main_#t~nondet7; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L549] call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; [L550] call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4); [L551] init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [L558-L561] assume 0 != init_nondet_ll_#t~nondet5; [L558] havoc init_nondet_ll_#t~nondet5; [L559] call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [L562] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L574] main_#t~ret8.base, main_#t~ret8.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset; [L574] havoc main_#t~ret8.base, main_#t~ret8.offset; [L575] traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset; [L575] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset; [L564-L570] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L566] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.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~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_~n~0, main_~head~1.base, main_~head~1.offset; [L573] main_~n~0 := main_#t~nondet7; [L573] havoc main_#t~nondet7; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L549] call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; [L550] call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4); [L551] init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [L558-L561] assume 0 != init_nondet_ll_#t~nondet5; [L558] havoc init_nondet_ll_#t~nondet5; [L559] call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [L562] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L574] main_#t~ret8.base, main_#t~ret8.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset; [L574] havoc main_#t~ret8.base, main_#t~ret8.offset; [L575] traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset; [L575] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset; [L564-L570] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L566] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8, main_~n~0, main_~head~1; [L573] main_~n~0 := main_#t~nondet7; [L573] havoc main_#t~nondet7; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res; [L574] havoc init_nondet_ll_#t~malloc2, init_nondet_ll_#t~malloc4, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0, init_nondet_ll_~curr~0; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0; [L549] FCALL call init_nondet_ll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0 := init_nondet_ll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_nondet_ll_~curr~0!base, offset: init_nondet_ll_~curr~0!offset }, 4); [L551] init_nondet_ll_~head~0 := init_nondet_ll_~curr~0; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] COND TRUE !(init_nondet_ll_~i~0 < init_nondet_ll_~n) [L558-L561] COND TRUE 0 != init_nondet_ll_#t~nondet5 [L558] havoc init_nondet_ll_#t~nondet5; [L559] FCALL call write~$Pointer$(init_nondet_ll_~head~0, { base: init_nondet_ll_~curr~0!base, offset: 4 + init_nondet_ll_~curr~0!offset }, 8); [L562] init_nondet_ll_#res := init_nondet_ll_~head~0; [L574] main_#t~ret8 := init_nondet_ll_#res; [L574] main_~head~1 := main_#t~ret8; [L574] havoc main_#t~ret8; [L575] traverse_#in~head := main_~head~1; [L575] havoc traverse_#t~mem6, traverse_~head, traverse_~curr~1; [L564-L570] traverse_~head := traverse_#in~head; [L566] traverse_~curr~1 := traverse_~head; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8, main_~n~0, main_~head~1; [L573] main_~n~0 := main_#t~nondet7; [L573] havoc main_#t~nondet7; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res; [L574] havoc init_nondet_ll_#t~malloc2, init_nondet_ll_#t~malloc4, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0, init_nondet_ll_~curr~0; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0; [L549] FCALL call init_nondet_ll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0 := init_nondet_ll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_nondet_ll_~curr~0!base, offset: init_nondet_ll_~curr~0!offset }, 4); [L551] init_nondet_ll_~head~0 := init_nondet_ll_~curr~0; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] COND TRUE !(init_nondet_ll_~i~0 < init_nondet_ll_~n) [L558-L561] COND TRUE 0 != init_nondet_ll_#t~nondet5 [L558] havoc init_nondet_ll_#t~nondet5; [L559] FCALL call write~$Pointer$(init_nondet_ll_~head~0, { base: init_nondet_ll_~curr~0!base, offset: 4 + init_nondet_ll_~curr~0!offset }, 8); [L562] init_nondet_ll_#res := init_nondet_ll_~head~0; [L574] main_#t~ret8 := init_nondet_ll_#res; [L574] main_~head~1 := main_#t~ret8; [L574] havoc main_#t~ret8; [L575] traverse_#in~head := main_~head~1; [L575] havoc traverse_#t~mem6, traverse_~head, traverse_~curr~1; [L564-L570] traverse_~head := traverse_#in~head; [L566] traverse_~curr~1 := traverse_~head; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet7; [L573] havoc #t~nondet7; [L546-L563] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558-L561] COND TRUE 0 != #t~nondet5 [L558] havoc #t~nondet5; [L559] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L562] #res := ~head~0; [L574] ~head~1 := #t~ret8; [L574] havoc #t~ret8; [L564-L570] ~head := #in~head; [L566] ~curr~1 := ~head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet7; [L573] havoc #t~nondet7; [L546-L563] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558-L561] COND TRUE 0 != #t~nondet5 [L558] havoc #t~nondet5; [L559] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L562] #res := ~head~0; [L574] ~head~1 := #t~ret8; [L574] havoc #t~ret8; [L564-L570] ~head := #in~head; [L566] ~curr~1 := ~head; [L573] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] COND TRUE __VERIFIER_nondet_int() [L559] curr->next = head [L562] return head; [L574] node_t* head = init_nondet_ll(n); [L566] node_t* curr = head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0);call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8);traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; [L567-L569] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0); [L568] call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8); [L568] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset; [L568] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L567-L569] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0); [L568] call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8); [L568] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset; [L568] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; [L567-L569] COND FALSE !(!(traverse_~curr~1 != { base: 0, offset: 0 })) [L568] FCALL call traverse_#t~mem6 := read~$Pointer$({ base: traverse_~curr~1!base, offset: 4 + traverse_~curr~1!offset }, 8); [L568] traverse_~curr~1 := traverse_#t~mem6; [L568] havoc traverse_#t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L567-L569] COND FALSE !(!(traverse_~curr~1 != { base: 0, offset: 0 })) [L568] FCALL call traverse_#t~mem6 := read~$Pointer$({ base: traverse_~curr~1!base, offset: 4 + traverse_~curr~1!offset }, 8); [L568] traverse_~curr~1 := traverse_#t~mem6; [L568] havoc traverse_#t~mem6; [L567-L569] COND FALSE !(!(~curr~1 != { base: 0, offset: 0 })) [L568] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L568] ~curr~1 := #t~mem6; [L568] havoc #t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L567-L569] COND FALSE !(!(~curr~1 != { base: 0, offset: 0 })) [L568] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L568] ~curr~1 := #t~mem6; [L568] havoc #t~mem6; [L567] COND TRUE curr != ((void *)0) [L568] EXPR curr->next [L568] curr = curr->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~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12);init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset;call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4);init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; [?] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [?] assume 0 != init_nondet_ll_#t~nondet5;havoc init_nondet_ll_#t~nondet5;call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [?] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [?] main_#t~ret8.base, main_#t~ret8.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset;traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset;traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset;traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_~n~0, main_~head~1.base, main_~head~1.offset; [L573] main_~n~0 := main_#t~nondet7; [L573] havoc main_#t~nondet7; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L549] call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; [L550] call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4); [L551] init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [L558-L561] assume 0 != init_nondet_ll_#t~nondet5; [L558] havoc init_nondet_ll_#t~nondet5; [L559] call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [L562] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L574] main_#t~ret8.base, main_#t~ret8.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset; [L574] havoc main_#t~ret8.base, main_#t~ret8.offset; [L575] traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset; [L575] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset; [L564-L570] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L566] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.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~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_~n~0, main_~head~1.base, main_~head~1.offset; [L573] main_~n~0 := main_#t~nondet7; [L573] havoc main_#t~nondet7; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L549] call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; [L550] call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4); [L551] init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [L558-L561] assume 0 != init_nondet_ll_#t~nondet5; [L558] havoc init_nondet_ll_#t~nondet5; [L559] call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [L562] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L574] main_#t~ret8.base, main_#t~ret8.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset; [L574] havoc main_#t~ret8.base, main_#t~ret8.offset; [L575] traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset; [L575] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset; [L564-L570] traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset; [L566] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8, main_~n~0, main_~head~1; [L573] main_~n~0 := main_#t~nondet7; [L573] havoc main_#t~nondet7; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res; [L574] havoc init_nondet_ll_#t~malloc2, init_nondet_ll_#t~malloc4, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0, init_nondet_ll_~curr~0; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0; [L549] FCALL call init_nondet_ll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0 := init_nondet_ll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_nondet_ll_~curr~0!base, offset: init_nondet_ll_~curr~0!offset }, 4); [L551] init_nondet_ll_~head~0 := init_nondet_ll_~curr~0; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] COND TRUE !(init_nondet_ll_~i~0 < init_nondet_ll_~n) [L558-L561] COND TRUE 0 != init_nondet_ll_#t~nondet5 [L558] havoc init_nondet_ll_#t~nondet5; [L559] FCALL call write~$Pointer$(init_nondet_ll_~head~0, { base: init_nondet_ll_~curr~0!base, offset: 4 + init_nondet_ll_~curr~0!offset }, 8); [L562] init_nondet_ll_#res := init_nondet_ll_~head~0; [L574] main_#t~ret8 := init_nondet_ll_#res; [L574] main_~head~1 := main_#t~ret8; [L574] havoc main_#t~ret8; [L575] traverse_#in~head := main_~head~1; [L575] havoc traverse_#t~mem6, traverse_~head, traverse_~curr~1; [L564-L570] traverse_~head := traverse_#in~head; [L566] traverse_~curr~1 := traverse_~head; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet7, main_#t~ret8, main_~n~0, main_~head~1; [L573] main_~n~0 := main_#t~nondet7; [L573] havoc main_#t~nondet7; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res; [L574] havoc init_nondet_ll_#t~malloc2, init_nondet_ll_#t~malloc4, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0, init_nondet_ll_~curr~0; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0; [L549] FCALL call init_nondet_ll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0 := init_nondet_ll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_nondet_ll_~curr~0!base, offset: init_nondet_ll_~curr~0!offset }, 4); [L551] init_nondet_ll_~head~0 := init_nondet_ll_~curr~0; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] COND TRUE !(init_nondet_ll_~i~0 < init_nondet_ll_~n) [L558-L561] COND TRUE 0 != init_nondet_ll_#t~nondet5 [L558] havoc init_nondet_ll_#t~nondet5; [L559] FCALL call write~$Pointer$(init_nondet_ll_~head~0, { base: init_nondet_ll_~curr~0!base, offset: 4 + init_nondet_ll_~curr~0!offset }, 8); [L562] init_nondet_ll_#res := init_nondet_ll_~head~0; [L574] main_#t~ret8 := init_nondet_ll_#res; [L574] main_~head~1 := main_#t~ret8; [L574] havoc main_#t~ret8; [L575] traverse_#in~head := main_~head~1; [L575] havoc traverse_#t~mem6, traverse_~head, traverse_~curr~1; [L564-L570] traverse_~head := traverse_#in~head; [L566] traverse_~curr~1 := traverse_~head; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet7; [L573] havoc #t~nondet7; [L546-L563] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558-L561] COND TRUE 0 != #t~nondet5 [L558] havoc #t~nondet5; [L559] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L562] #res := ~head~0; [L574] ~head~1 := #t~ret8; [L574] havoc #t~ret8; [L564-L570] ~head := #in~head; [L566] ~curr~1 := ~head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet7; [L573] havoc #t~nondet7; [L546-L563] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558-L561] COND TRUE 0 != #t~nondet5 [L558] havoc #t~nondet5; [L559] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L562] #res := ~head~0; [L574] ~head~1 := #t~ret8; [L574] havoc #t~ret8; [L564-L570] ~head := #in~head; [L566] ~curr~1 := ~head; [L573] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] COND TRUE __VERIFIER_nondet_int() [L559] curr->next = head [L562] return head; [L574] node_t* head = init_nondet_ll(n); [L566] node_t* curr = head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0);call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8);traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset;havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; [L567-L569] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0); [L568] call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8); [L568] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset; [L568] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L567-L569] assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0); [L568] call traverse_#t~mem6.base, traverse_#t~mem6.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8); [L568] traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem6.base, traverse_#t~mem6.offset; [L568] havoc traverse_#t~mem6.base, traverse_#t~mem6.offset; [L567-L569] COND FALSE !(!(traverse_~curr~1 != { base: 0, offset: 0 })) [L568] FCALL call traverse_#t~mem6 := read~$Pointer$({ base: traverse_~curr~1!base, offset: 4 + traverse_~curr~1!offset }, 8); [L568] traverse_~curr~1 := traverse_#t~mem6; [L568] havoc traverse_#t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L567-L569] COND FALSE !(!(traverse_~curr~1 != { base: 0, offset: 0 })) [L568] FCALL call traverse_#t~mem6 := read~$Pointer$({ base: traverse_~curr~1!base, offset: 4 + traverse_~curr~1!offset }, 8); [L568] traverse_~curr~1 := traverse_#t~mem6; [L568] havoc traverse_#t~mem6; [L567-L569] COND FALSE !(!(~curr~1 != { base: 0, offset: 0 })) [L568] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L568] ~curr~1 := #t~mem6; [L568] havoc #t~mem6; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L567-L569] COND FALSE !(!(~curr~1 != { base: 0, offset: 0 })) [L568] FCALL call #t~mem6 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L568] ~curr~1 := #t~mem6; [L568] havoc #t~mem6; [L567] COND TRUE curr != ((void *)0) [L568] EXPR curr->next [L568] curr = curr->next ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L573] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] COND TRUE __VERIFIER_nondet_int() [L559] curr->next = head [L562] return head; [L574] node_t* head = init_nondet_ll(n); [L566] node_t* curr = head; Loop: [L567] COND TRUE curr != ((void *)0) [L568] EXPR curr->next [L568] curr = curr->next End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...