./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-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_b94a2e7b-422a-4574-b825-99c7c54859cf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b94a2e7b-422a-4574-b825-99c7c54859cf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b94a2e7b-422a-4574-b825-99c7c54859cf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b94a2e7b-422a-4574-b825-99c7c54859cf/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b94a2e7b-422a-4574-b825-99c7c54859cf/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b94a2e7b-422a-4574-b825-99c7c54859cf/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 3cca4963db77635bc2da65f99e90064d806437e6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 09:51:21,495 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:51:21,496 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:51:21,502 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:51:21,502 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:51:21,503 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:51:21,504 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:51:21,505 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:51:21,506 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:51:21,507 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:51:21,507 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:51:21,507 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:51:21,508 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:51:21,509 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:51:21,509 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:51:21,509 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:51:21,510 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:51:21,511 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:51:21,512 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:51:21,513 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:51:21,514 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:51:21,515 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:51:21,516 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:51:21,516 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:51:21,516 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:51:21,517 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:51:21,518 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:51:21,518 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:51:21,518 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:51:21,519 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:51:21,519 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:51:21,519 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:51:21,520 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:51:21,520 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:51:21,520 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:51:21,521 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:51:21,521 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b94a2e7b-422a-4574-b825-99c7c54859cf/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 09:51:21,528 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:51:21,528 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:51:21,529 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:51:21,529 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:51:21,529 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:51:21,529 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 09:51:21,529 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 09:51:21,530 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 09:51:21,530 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 09:51:21,530 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 09:51:21,530 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 09:51:21,530 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:51:21,530 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 09:51:21,530 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 09:51:21,530 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:51:21,531 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 09:51:21,531 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 09:51:21,531 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 09:51:21,531 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:51:21,531 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 09:51:21,531 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:51:21,531 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 09:51:21,532 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:51:21,532 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:51:21,532 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 09:51:21,532 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:51:21,532 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 09:51:21,532 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 09:51:21,533 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 09:51:21,533 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_b94a2e7b-422a-4574-b825-99c7c54859cf/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 -> 3cca4963db77635bc2da65f99e90064d806437e6 [2018-11-23 09:51:21,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:51:21,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:51:21,567 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:51:21,568 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:51:21,568 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:51:21,568 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b94a2e7b-422a-4574-b825-99c7c54859cf/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-11-23 09:51:21,609 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b94a2e7b-422a-4574-b825-99c7c54859cf/bin-2019/uautomizer/data/234d433a5/793bbb27900540eead19899858f5220c/FLAGcdb0f1dae [2018-11-23 09:51:22,038 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:51:22,039 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b94a2e7b-422a-4574-b825-99c7c54859cf/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-11-23 09:51:22,046 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b94a2e7b-422a-4574-b825-99c7c54859cf/bin-2019/uautomizer/data/234d433a5/793bbb27900540eead19899858f5220c/FLAGcdb0f1dae [2018-11-23 09:51:22,057 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b94a2e7b-422a-4574-b825-99c7c54859cf/bin-2019/uautomizer/data/234d433a5/793bbb27900540eead19899858f5220c [2018-11-23 09:51:22,060 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:51:22,061 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:51:22,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:51:22,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:51:22,064 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:51:22,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:51:22" (1/1) ... [2018-11-23 09:51:22,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1831a0aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:22, skipping insertion in model container [2018-11-23 09:51:22,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:51:22" (1/1) ... [2018-11-23 09:51:22,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:51:22,102 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:51:22,288 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:51:22,296 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:51:22,373 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:51:22,402 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:51:22,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:22 WrapperNode [2018-11-23 09:51:22,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:51:22,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:51:22,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:51:22,403 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:51:22,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:22" (1/1) ... [2018-11-23 09:51:22,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:22" (1/1) ... [2018-11-23 09:51:22,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:51:22,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:51:22,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:51:22,427 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:51:22,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:22" (1/1) ... [2018-11-23 09:51:22,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:22" (1/1) ... [2018-11-23 09:51:22,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:22" (1/1) ... [2018-11-23 09:51:22,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:22" (1/1) ... [2018-11-23 09:51:22,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:22" (1/1) ... [2018-11-23 09:51:22,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:22" (1/1) ... [2018-11-23 09:51:22,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:22" (1/1) ... [2018-11-23 09:51:22,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:51:22,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:51:22,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:51:22,443 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:51:22,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b94a2e7b-422a-4574-b825-99c7c54859cf/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 09:51:22,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:51:22,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 09:51:22,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 09:51:22,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:51:22,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:51:22,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:51:22,650 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:51:22,650 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 09:51:22,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:51:22 BoogieIcfgContainer [2018-11-23 09:51:22,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:51:22,651 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 09:51:22,651 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 09:51:22,653 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 09:51:22,653 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 09:51:22,654 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 09:51:22" (1/3) ... [2018-11-23 09:51:22,654 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d153cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 09:51:22, skipping insertion in model container [2018-11-23 09:51:22,654 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 09:51:22,655 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:51:22" (2/3) ... [2018-11-23 09:51:22,655 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d153cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 09:51:22, skipping insertion in model container [2018-11-23 09:51:22,655 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 09:51:22,655 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:51:22" (3/3) ... [2018-11-23 09:51:22,657 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-11-23 09:51:22,695 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:51:22,696 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 09:51:22,696 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 09:51:22,696 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 09:51:22,696 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:51:22,696 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:51:22,696 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 09:51:22,696 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:51:22,696 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 09:51:22,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-23 09:51:22,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 09:51:22,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:51:22,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:51:22,724 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 09:51:22,724 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 09:51:22,725 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 09:51:22,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-23 09:51:22,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 09:51:22,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:51:22,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:51:22,726 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 09:51:22,726 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 09:51:22,732 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 11#L554-2true [2018-11-23 09:51:22,733 INFO L796 eck$LassoCheckResult]: Loop: 11#L554-2true call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 14#L551-1true assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 3#L551-3true main_#t~short9 := main_#t~short7; 5#L551-4true assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 6#L551-6true assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 12#L552true assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 11#L554-2true [2018-11-23 09:51:22,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:22,737 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 09:51:22,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:51:22,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:51:22,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:22,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:51:22,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:22,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:22,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2018-11-23 09:51:22,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:51:22,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:51:22,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:22,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:51:22,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:22,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:22,836 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2018-11-23 09:51:22,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:51:22,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:51:22,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:22,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:51:22,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:23,049 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2018-11-23 09:51:23,195 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:51:23,195 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:51:23,195 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:51:23,196 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:51:23,196 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 09:51:23,196 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:51:23,196 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:51:23,196 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:51:23,196 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-23 09:51:23,196 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:51:23,197 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:51:23,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:23,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:23,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:23,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:23,222 INFO 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 09:51:23,224 INFO 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 09:51:23,482 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2018-11-23 09:51:23,483 INFO 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 09:51:23,485 INFO 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 09:51:23,486 INFO 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 09:51:23,487 INFO 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 09:51:23,493 INFO 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 09:51:23,496 INFO 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 09:51:23,497 INFO 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 09:51:23,499 INFO 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 09:51:23,502 INFO 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 09:51:23,517 INFO 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 09:51:23,518 INFO 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 09:51:23,520 INFO 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 09:51:23,521 INFO 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 09:51:23,809 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:51:23,814 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 09:51:23,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:23,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:23,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:23,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:23,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:23,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:23,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:23,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:23,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:23,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:23,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:23,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:23,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:23,822 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 09:51:23,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:23,823 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 09:51:23,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:23,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:23,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:23,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:23,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:23,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:23,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:23,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:23,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:23,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:23,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:23,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:23,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:23,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:23,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:23,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:23,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:23,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:23,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:23,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:23,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:23,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:23,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:23,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:23,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:23,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:23,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:23,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:23,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:23,842 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:51:23,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:23,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:23,844 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:51:23,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:23,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:23,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:23,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:23,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:23,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:23,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:23,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:23,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:23,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:23,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:23,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:23,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:23,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:23,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:23,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:23,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:23,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:23,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:23,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:23,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:23,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:23,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:23,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:23,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:23,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:23,879 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 09:51:23,882 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 09:51:23,882 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 09:51:23,884 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 09:51:23,884 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 09:51:23,884 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 09:51:23,884 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-11-23 09:51:23,958 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 09:51:23,963 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 09:51:23,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:51:23,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:51:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:51:24,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:51:24,040 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 09:51:24,049 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 09:51:24,049 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2018-11-23 09:51:24,109 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 60 states and 79 transitions. Complement of second has 10 states. [2018-11-23 09:51:24,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 09:51:24,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 09:51:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-11-23 09:51:24,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-23 09:51:24,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:51:24,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-23 09:51:24,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:51:24,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-23 09:51:24,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:51:24,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2018-11-23 09:51:24,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-23 09:51:24,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 34 states and 50 transitions. [2018-11-23 09:51:24,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 09:51:24,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 09:51:24,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2018-11-23 09:51:24,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 09:51:24,125 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2018-11-23 09:51:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2018-11-23 09:51:24,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-11-23 09:51:24,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 09:51:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2018-11-23 09:51:24,141 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-11-23 09:51:24,142 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-11-23 09:51:24,142 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 09:51:24,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2018-11-23 09:51:24,142 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-23 09:51:24,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:51:24,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:51:24,143 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 09:51:24,143 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 09:51:24,143 INFO L794 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 225#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 226#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 246#L551-1 [2018-11-23 09:51:24,143 INFO L796 eck$LassoCheckResult]: Loop: 246#L551-1 assume !main_#t~short7; 227#L551-3 main_#t~short9 := main_#t~short7; 228#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 232#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 242#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 247#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 246#L551-1 [2018-11-23 09:51:24,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:24,144 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-23 09:51:24,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:51:24,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:51:24,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:24,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:51:24,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:24,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:24,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1244514134, now seen corresponding path program 1 times [2018-11-23 09:51:24,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:51:24,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:51:24,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:24,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:51:24,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:51:24,192 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 09:51:24,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:51:24,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:51:24,194 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 09:51:24,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:51:24,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:51:24,196 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-11-23 09:51:24,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:51:24,225 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 09:51:24,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 09:51:24,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2018-11-23 09:51:24,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 09:51:24,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 25 transitions. [2018-11-23 09:51:24,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-23 09:51:24,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 09:51:24,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2018-11-23 09:51:24,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 09:51:24,228 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-23 09:51:24,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2018-11-23 09:51:24,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 09:51:24,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 09:51:24,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-23 09:51:24,229 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-23 09:51:24,230 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-23 09:51:24,230 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 09:51:24,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-11-23 09:51:24,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 09:51:24,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:51:24,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:51:24,231 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:51:24,231 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:51:24,232 INFO L794 eck$LassoCheckResult]: Stem: 306#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 302#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 303#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 311#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 318#L551-3 main_#t~short9 := main_#t~short7; 317#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 316#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 312#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 313#L554 [2018-11-23 09:51:24,232 INFO L796 eck$LassoCheckResult]: Loop: 313#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 307#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 308#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 298#L551-3 main_#t~short9 := main_#t~short7; 299#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 304#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 315#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 313#L554 [2018-11-23 09:51:24,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:24,232 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2018-11-23 09:51:24,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:51:24,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:51:24,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:24,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:51:24,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:24,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:24,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1175734219, now seen corresponding path program 1 times [2018-11-23 09:51:24,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:51:24,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:51:24,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:24,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:51:24,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:24,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:24,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1517982238, now seen corresponding path program 1 times [2018-11-23 09:51:24,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:51:24,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:51:24,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:24,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:51:24,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:24,442 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2018-11-23 09:51:24,643 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 78 [2018-11-23 09:51:24,677 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:51:24,678 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:51:24,678 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:51:24,678 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:51:24,678 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 09:51:24,678 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:51:24,678 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:51:24,678 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:51:24,678 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 09:51:24,678 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:51:24,678 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:51:24,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:24,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:24,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:24,684 INFO 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 09:51:24,686 INFO 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 09:51:24,870 INFO 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 09:51:24,872 INFO 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 09:51:24,874 INFO 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 09:51:24,875 INFO 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 09:51:24,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:24,877 INFO 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 09:51:24,879 INFO 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 09:51:24,881 INFO 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 09:51:24,882 INFO 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 09:51:24,884 INFO 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 09:51:24,885 INFO 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 09:51:24,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:24,887 INFO 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 09:51:25,126 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:51:25,126 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 09:51:25,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:25,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:25,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:25,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:25,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:25,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:25,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:25,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:25,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:25,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:25,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:25,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:25,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:25,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:25,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:25,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:25,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:25,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:25,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:25,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:25,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:25,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:25,130 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 09:51:25,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:25,131 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 09:51:25,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:25,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:25,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:25,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:25,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:25,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:25,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:25,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:25,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:25,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:25,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:25,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:25,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:25,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:25,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:25,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:25,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:25,149 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 09:51:25,156 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 09:51:25,156 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 09:51:25,157 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 09:51:25,158 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 09:51:25,158 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 09:51:25,158 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 Supporting invariants [] [2018-11-23 09:51:25,200 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 09:51:25,202 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 09:51:25,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:51:25,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:51:25,235 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 09:51:25,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:25,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:25,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 09:51:25,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:25,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:25,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:25,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-23 09:51:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:51:25,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:51:25,275 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:25,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-23 09:51:25,278 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:25,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 09:51:25,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:25,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-23 09:51:25,292 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 09:51:25,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:25,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:25,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:25,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:25,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-11-23 09:51:25,364 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 09:51:25,364 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 09:51:25,364 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-23 09:51:25,448 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 48 states and 58 transitions. Complement of second has 12 states. [2018-11-23 09:51:25,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 09:51:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 09:51:25,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-11-23 09:51:25,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 8 letters. Loop has 7 letters. [2018-11-23 09:51:25,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:51:25,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 15 letters. Loop has 7 letters. [2018-11-23 09:51:25,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:51:25,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 8 letters. Loop has 14 letters. [2018-11-23 09:51:25,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:51:25,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 58 transitions. [2018-11-23 09:51:25,450 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-23 09:51:25,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 43 states and 52 transitions. [2018-11-23 09:51:25,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 09:51:25,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-23 09:51:25,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 52 transitions. [2018-11-23 09:51:25,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 09:51:25,451 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-23 09:51:25,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 52 transitions. [2018-11-23 09:51:25,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-23 09:51:25,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 09:51:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 09:51:25,453 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 09:51:25,453 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 09:51:25,453 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 09:51:25,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 49 transitions. [2018-11-23 09:51:25,453 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-23 09:51:25,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:51:25,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:51:25,454 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:51:25,454 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 09:51:25,454 INFO L794 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 553#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 554#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 577#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 582#L551-3 main_#t~short9 := main_#t~short7; 581#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 580#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 579#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 578#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 559#L554-2 [2018-11-23 09:51:25,454 INFO L796 eck$LassoCheckResult]: Loop: 559#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 563#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 549#L551-3 main_#t~short9 := main_#t~short7; 550#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 555#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 558#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 559#L554-2 [2018-11-23 09:51:25,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:25,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450581, now seen corresponding path program 1 times [2018-11-23 09:51:25,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:51:25,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:51:25,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:25,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:51:25,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:25,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:25,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2018-11-23 09:51:25,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:51:25,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:51:25,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:25,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:51:25,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:25,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:25,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1001977698, now seen corresponding path program 1 times [2018-11-23 09:51:25,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:51:25,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:51:25,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:25,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:51:25,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:25,777 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 93 [2018-11-23 09:51:25,822 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:51:25,822 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:51:25,822 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:51:25,822 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:51:25,822 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 09:51:25,822 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:51:25,822 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:51:25,823 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:51:25,823 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-23 09:51:25,823 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:51:25,823 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:51:25,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:25,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:25,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:25,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:25,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:25,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:25,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:25,845 INFO 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 09:51:25,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:25,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:25,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:25,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:25,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:25,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:25,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:25,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:26,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:26,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 09:51:26,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 09:51:26,268 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:51:26,268 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 09:51:26,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 09:51:26,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:26,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:26,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:26,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,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 09:51:26,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:26,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:26,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:26,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:26,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:26,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:26,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:26,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:26,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:26,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:26,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,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 09:51:26,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:26,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:26,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:26,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:26,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:26,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:26,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,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 09:51:26,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:26,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:26,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:26,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:26,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:26,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:26,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,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 09:51:26,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:26,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:26,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:26,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:26,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:26,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:26,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:26,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:26,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:26,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:26,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:26,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:26,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:26,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:26,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:26,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:26,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:26,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:26,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,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 09:51:26,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:26,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:26,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:26,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:26,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:26,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:26,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:26,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:26,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,296 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:51:26,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,297 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:51:26,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:26,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:26,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:26,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:26,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:26,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:26,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:26,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:26,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,312 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:51:26,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,313 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:51:26,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:26,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:26,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:26,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:26,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:26,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:26,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:26,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:26,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:26,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:26,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:26,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:26,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:26,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:26,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:26,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:26,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:26,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:26,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:26,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:26,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:26,329 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:26,333 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 09:51:26,335 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 09:51:26,335 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 09:51:26,335 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 09:51:26,336 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 09:51:26,336 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 09:51:26,336 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-11-23 09:51:26,403 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 09:51:26,404 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 09:51:26,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:51:26,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:51:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:51:26,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:51:26,465 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 09:51:26,465 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 09:51:26,466 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-23 09:51:26,493 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 55 states and 66 transitions. Complement of second has 7 states. [2018-11-23 09:51:26,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 09:51:26,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 09:51:26,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 09:51:26,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-23 09:51:26,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:51:26,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-23 09:51:26,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:51:26,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 12 letters. [2018-11-23 09:51:26,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:51:26,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 66 transitions. [2018-11-23 09:51:26,496 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-23 09:51:26,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 54 states and 65 transitions. [2018-11-23 09:51:26,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-23 09:51:26,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-23 09:51:26,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 65 transitions. [2018-11-23 09:51:26,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 09:51:26,497 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-11-23 09:51:26,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 65 transitions. [2018-11-23 09:51:26,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-23 09:51:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 09:51:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-11-23 09:51:26,505 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-11-23 09:51:26,505 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-11-23 09:51:26,505 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 09:51:26,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 63 transitions. [2018-11-23 09:51:26,506 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-23 09:51:26,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:51:26,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:51:26,506 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-23 09:51:26,506 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 09:51:26,506 INFO L794 eck$LassoCheckResult]: Stem: 819#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 815#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 816#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 845#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 844#L551-3 main_#t~short9 := main_#t~short7; 843#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 842#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 841#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 840#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 831#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 838#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 837#L551-3 main_#t~short9 := main_#t~short7; 835#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 836#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 848#L552 [2018-11-23 09:51:26,507 INFO L796 eck$LassoCheckResult]: Loop: 848#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 849#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 858#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 855#L551-3 main_#t~short9 := main_#t~short7; 854#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 851#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 848#L552 [2018-11-23 09:51:26,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:26,507 INFO L82 PathProgramCache]: Analyzing trace with hash 48967168, now seen corresponding path program 2 times [2018-11-23 09:51:26,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:51:26,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:51:26,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:26,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:51:26,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:26,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:26,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1695896472, now seen corresponding path program 3 times [2018-11-23 09:51:26,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:51:26,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:51:26,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:26,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:51:26,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:26,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:26,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1971308119, now seen corresponding path program 1 times [2018-11-23 09:51:26,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:51:26,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:51:26,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:26,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:51:26,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:26,949 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 108 [2018-11-23 09:51:27,006 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:51:27,006 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:51:27,006 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:51:27,006 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:51:27,006 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 09:51:27,006 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:51:27,006 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:51:27,006 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:51:27,007 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-23 09:51:27,007 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:51:27,007 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:51:27,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:27,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:27,013 INFO 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 09:51:27,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:27,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:27,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:27,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:27,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:27,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51: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 09:51:27,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:27,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51: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 09:51:27,230 INFO 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 09:51:27,231 INFO 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 09:51:27,233 INFO 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 09:51:27,234 INFO 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 09:51:27,235 INFO 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 09:51:27,236 INFO 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 09:51:27,448 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:51:27,448 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 09:51:27,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:27,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:27,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:27,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:27,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:27,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:27,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:27,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:27,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:27,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51: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 09:51:27,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:27,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:27,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:27,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:27,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:27,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:27,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:27,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51: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 09:51:27,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:27,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:27,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:27,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:27,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:27,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:27,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:27,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:27,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:27,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:27,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:27,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:27,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:27,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:27,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:27,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:27,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:27,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:27,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:27,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:27,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:27,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:27,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51: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 09:51:27,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:27,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:27,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:27,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:27,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:27,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:27,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:27,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:27,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:27,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:27,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:27,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:27,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:27,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:27,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:27,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:27,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:27,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:27,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:27,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:27,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:27,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:27,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:27,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:27,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:27,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:27,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,499 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:51:27,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,500 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:51:27,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:27,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:27,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:27,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:27,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:27,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:27,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:27,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:27,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:27,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:27,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:27,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:27,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:27,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:27,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:27,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:27,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:27,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:27,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:27,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:27,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:27,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:27,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:27,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:27,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:27,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:27,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:27,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:27,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:27,534 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 09:51:27,539 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 09:51:27,539 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 09:51:27,539 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 09:51:27,540 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 09:51:27,540 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 09:51:27,540 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4 Supporting invariants [] [2018-11-23 09:51:27,597 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 09:51:27,599 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 09:51:27,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:51:27,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:51:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:51:27,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:51:27,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:27,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 09:51:27,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:27,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 09:51:27,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:27,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:27,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:27,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-11-23 09:51: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 09:51:27,667 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 09:51:27,667 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-23 09:51:27,691 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 74 states and 87 transitions. Complement of second has 9 states. [2018-11-23 09:51:27,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 09:51:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 09:51:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-23 09:51:27,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-23 09:51:27,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:51:27,692 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 09:51:27,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:51:27,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:51:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:51:27,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:51:27,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:27,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 09:51:27,730 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:27,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 09:51:27,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:27,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:27,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:27,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-11-23 09:51:27,760 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 09:51:27,760 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 09:51:27,761 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-23 09:51:27,789 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 72 states and 83 transitions. Complement of second has 11 states. [2018-11-23 09:51:27,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 09:51:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 09:51:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-11-23 09:51:27,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-23 09:51:27,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:51:27,792 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 09:51:27,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:51:27,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:51:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:51:27,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:51:27,817 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:27,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 09:51:27,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:27,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 09:51:27,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:27,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:27,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:27,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-11-23 09:51:27,851 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 09:51:27,852 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 09:51:27,852 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-23 09:51:27,875 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 118 states and 142 transitions. Complement of second has 10 states. [2018-11-23 09:51:27,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 09:51:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 09:51:27,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-23 09:51:27,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-23 09:51:27,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:51:27,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 20 letters. Loop has 6 letters. [2018-11-23 09:51:27,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:51:27,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 14 letters. Loop has 12 letters. [2018-11-23 09:51:27,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:51:27,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 142 transitions. [2018-11-23 09:51:27,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-23 09:51:27,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 90 states and 103 transitions. [2018-11-23 09:51:27,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-23 09:51:27,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-23 09:51:27,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 103 transitions. [2018-11-23 09:51:27,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 09:51:27,881 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 103 transitions. [2018-11-23 09:51:27,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 103 transitions. [2018-11-23 09:51:27,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2018-11-23 09:51:27,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 09:51:27,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2018-11-23 09:51:27,885 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2018-11-23 09:51:27,885 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2018-11-23 09:51:27,885 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 09:51:27,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 80 transitions. [2018-11-23 09:51:27,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-23 09:51:27,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:51:27,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:51:27,886 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-23 09:51:27,886 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1] [2018-11-23 09:51:27,886 INFO L794 eck$LassoCheckResult]: Stem: 1473#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1469#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1470#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1498#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1494#L551-3 main_#t~short9 := main_#t~short7; 1491#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1489#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 1486#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 1487#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 1474#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1476#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1465#L551-3 main_#t~short9 := main_#t~short7; 1466#L551-4 [2018-11-23 09:51:27,887 INFO L796 eck$LassoCheckResult]: Loop: 1466#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1471#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 1479#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 1480#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 1504#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1526#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1525#L551-3 main_#t~short9 := main_#t~short7; 1524#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1523#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 1522#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 1477#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1478#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1531#L551-3 main_#t~short9 := main_#t~short7; 1466#L551-4 [2018-11-23 09:51:27,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:27,887 INFO L82 PathProgramCache]: Analyzing trace with hash -285922666, now seen corresponding path program 2 times [2018-11-23 09:51:27,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:51:27,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:51:27,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:27,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:51:27,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:27,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:27,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1998556810, now seen corresponding path program 1 times [2018-11-23 09:51:27,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:51:27,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:51:27,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:27,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:51:27,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:27,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:27,916 INFO L82 PathProgramCache]: Analyzing trace with hash 691396865, now seen corresponding path program 1 times [2018-11-23 09:51:27,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:51:27,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:51:27,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:27,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:51:27,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:51:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:51:28,194 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 93 [2018-11-23 09:51:28,528 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 105 [2018-11-23 09:51:28,593 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:51:28,593 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:51:28,593 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:51:28,593 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:51:28,593 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 09:51:28,593 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:51:28,593 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:51:28,593 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:51:28,594 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-23 09:51:28,594 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:51:28,594 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:51:28,596 INFO 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 09:51:28,598 INFO 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 09:51:28,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:28,602 INFO 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 09:51:28,798 INFO 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 09:51:28,799 INFO 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 09:51:28,800 INFO 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 09:51:28,801 INFO 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 09:51:28,803 INFO 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 09:51:28,804 INFO 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 09:51:28,805 INFO 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 09:51:28,807 INFO 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 09:51:28,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:28,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:28,819 INFO 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 09:51:28,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:28,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:51:29,055 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:51:29,055 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 09:51:29,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:29,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:29,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:51:29,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:29,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:29,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:29,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:51:29,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:51:29,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:29,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:29,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:29,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:29,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:29,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:29,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:29,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:29,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:29,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:29,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:29,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:29,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:29,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:29,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:29,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:29,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:29,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:29,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:29,062 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:51:29,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:29,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:29,062 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:51:29,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:29,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:29,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:29,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:29,065 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:51:29,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:29,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:29,066 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:51:29,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:29,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:29,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:29,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:29,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:29,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:29,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:29,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:29,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:29,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:29,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:29,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:29,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:29,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:29,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:29,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:29,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:29,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:29,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:29,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:29,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:29,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:29,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:29,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:29,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:29,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:29,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:29,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:29,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:29,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:29,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:29,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:29,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:29,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:51:29,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:51:29,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:51:29,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:51:29,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:51:29,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:51:29,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:51:29,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:51:29,097 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 09:51:29,099 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 09:51:29,099 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 09:51:29,099 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 09:51:29,100 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 09:51:29,100 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 09:51:29,100 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5 Supporting invariants [] [2018-11-23 09:51:29,168 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 09:51:29,169 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 09:51:29,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:51:29,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:51:29,195 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:29,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 09:51:29,204 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:29,205 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:29,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 09:51:29,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-23 09:51:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:51:29,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:51:29,231 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:29,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 56 [2018-11-23 09:51:29,242 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:29,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-23 09:51:29,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:29,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 52 [2018-11-23 09:51:29,278 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-23 09:51:29,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-23 09:51:29,314 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 09:51:29,314 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,319 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 09:51:29,324 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 09:51:29,324 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,329 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-23 09:51:29,357 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 09:51:29,357 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,361 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 09:51:29,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 09:51:29,401 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:51, output treesize:27 [2018-11-23 09:51:29,407 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:29,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 09:51:29,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:29,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 09:51:29,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2018-11-23 09:51:29,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 09:51:29,442 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-23 09:51:29,443 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand 7 states. [2018-11-23 09:51:29,492 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand 7 states. Result 109 states and 129 transitions. Complement of second has 10 states. [2018-11-23 09:51:29,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 09:51:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 09:51:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-11-23 09:51:29,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 12 letters. Loop has 13 letters. [2018-11-23 09:51:29,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:51:29,493 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 09:51:29,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:51:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:51:29,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:51:29,520 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:29,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 09:51:29,529 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:29,530 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:29,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 09:51:29,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-23 09:51:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:51:29,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:51:29,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:29,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 56 [2018-11-23 09:51:29,565 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:29,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 52 [2018-11-23 09:51:29,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-23 09:51:29,610 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:29,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-11-23 09:51:29,611 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-23 09:51:29,649 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 09:51:29,649 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,654 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-23 09:51:29,695 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 09:51:29,695 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,710 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 09:51:29,733 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 09:51:29,733 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,738 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:29,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 09:51:29,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 09:51:29,767 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:51, output treesize:50 [2018-11-23 09:51:30,053 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:30,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2018-11-23 09:51:30,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:30,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 09:51:30,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:30,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:30,090 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:30,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2018-11-23 09:51:30,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:30,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-11-23 09:51:30,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:30,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:30,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2018-11-23 09:51:30,130 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:30,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:51:30,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:30,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2018-11-23 09:51:30,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:30,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-11-23 09:51:30,174 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:30,189 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:51:30,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-23 09:51:30,189 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 09:51:30,198 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 09:51:30,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-11-23 09:51:30,216 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:119, output treesize:93 [2018-11-23 09:51:30,442 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-11-23 09:51:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:51:30,487 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2018-11-23 09:51:30,487 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand 11 states. [2018-11-23 09:52:19,079 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2018-11-23 09:53:07,685 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand 11 states. Result 109 states and 127 transitions. Complement of second has 22 states. [2018-11-23 09:53:07,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-23 09:53:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 09:53:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-11-23 09:53:07,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 21 transitions. Stem has 12 letters. Loop has 13 letters. [2018-11-23 09:53:07,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:07,692 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 09:53:07,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:53:07,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:07,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:07,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 09:53:07,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:07,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:07,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 09:53:07,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:07,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:07,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:07,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-23 09:53:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:53:07,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:07,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:07,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 56 [2018-11-23 09:53:07,769 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:07,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 52 [2018-11-23 09:53:07,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-23 09:53:07,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:07,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-11-23 09:53:07,817 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:07,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-23 09:53:07,851 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 09:53:07,851 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:07,856 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:07,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-23 09:53:07,883 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 09:53:07,883 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:07,888 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:07,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 09:53:07,893 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 09:53:07,893 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:07,898 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:07,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 09:53:07,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 09:53:07,936 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:51, output treesize:27 [2018-11-23 09:53:07,941 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:07,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-23 09:53:07,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:07,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 09:53:07,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:07,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:07,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:07,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2018-11-23 09:53:07,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 09:53:07,984 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-23 09:53:07,984 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand 7 states. [2018-11-23 09:53:08,026 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand 7 states. Result 141 states and 167 transitions. Complement of second has 12 states. [2018-11-23 09:53:08,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 09:53:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 09:53:08,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-11-23 09:53:08,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 12 letters. Loop has 13 letters. [2018-11-23 09:53:08,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:08,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 25 letters. Loop has 13 letters. [2018-11-23 09:53:08,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:08,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 12 letters. Loop has 26 letters. [2018-11-23 09:53:08,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:08,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 167 transitions. [2018-11-23 09:53:08,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-11-23 09:53:08,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 110 states and 130 transitions. [2018-11-23 09:53:08,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-23 09:53:08,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-23 09:53:08,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 130 transitions. [2018-11-23 09:53:08,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 09:53:08,029 INFO L705 BuchiCegarLoop]: Abstraction has 110 states and 130 transitions. [2018-11-23 09:53:08,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 130 transitions. [2018-11-23 09:53:08,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 92. [2018-11-23 09:53:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 09:53:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2018-11-23 09:53:08,032 INFO L728 BuchiCegarLoop]: Abstraction has 92 states and 112 transitions. [2018-11-23 09:53:08,032 INFO L608 BuchiCegarLoop]: Abstraction has 92 states and 112 transitions. [2018-11-23 09:53:08,032 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 09:53:08,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 112 transitions. [2018-11-23 09:53:08,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-11-23 09:53:08,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:53:08,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:53:08,034 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-23 09:53:08,034 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:53:08,034 INFO L794 eck$LassoCheckResult]: Stem: 2320#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2315#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 2316#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2370#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2367#L551-3 main_#t~short9 := main_#t~short7; 2368#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2328#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 2321#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2322#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 2336#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2395#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2396#L551-3 main_#t~short9 := main_#t~short7; 2390#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2317#L551-6 [2018-11-23 09:53:08,034 INFO L796 eck$LassoCheckResult]: Loop: 2317#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 2343#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2340#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 2325#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2326#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2392#L551-3 main_#t~short9 := main_#t~short7; 2393#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2317#L551-6 [2018-11-23 09:53:08,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:08,034 INFO L82 PathProgramCache]: Analyzing trace with hash -273668037, now seen corresponding path program 3 times [2018-11-23 09:53:08,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:53:08,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:53:08,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:08,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:53:08,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:08,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:08,047 INFO L82 PathProgramCache]: Analyzing trace with hash -947985053, now seen corresponding path program 1 times [2018-11-23 09:53:08,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:53:08,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:53:08,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:08,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:53:08,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:08,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:08,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1982470167, now seen corresponding path program 4 times [2018-11-23 09:53:08,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:53:08,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:53:08,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:08,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:53:08,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:08,194 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2018-11-23 09:53:08,584 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 116 [2018-11-23 09:53:08,951 WARN L180 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 95 [2018-11-23 09:53:08,953 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:53:08,953 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:53:08,953 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:53:08,953 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:53:08,953 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 09:53:08,953 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:53:08,953 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:53:08,953 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:53:08,953 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-23 09:53:08,953 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:53:08,953 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:53:08,958 INFO 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 09:53:08,965 INFO 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 09:53:09,305 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2018-11-23 09:53:09,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 09:53:09,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 09:53:09,394 INFO 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 09:53:09,395 INFO 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 09:53:09,397 INFO 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 09:53:09,397 INFO 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 09:53:09,399 INFO 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 09:53:09,400 INFO 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 09:53:09,401 INFO 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 09:53:09,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 09:53:09,403 INFO 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 09:53:09,404 INFO 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 09:53:09,406 INFO 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 09:53:09,764 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:53:09,765 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 09:53:09,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:09,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:09,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,767 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:09,768 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 09:53:09,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,769 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 09:53:09,770 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:09,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,790 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:09,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,791 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:53:09,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:09,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,794 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:09,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,794 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:53:09,794 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:09,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:09,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:09,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:09,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:09,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:09,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:09,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:09,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:09,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:09,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:09,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:09,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:09,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,826 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:09,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,827 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:53:09,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:09,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:09,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:09,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:09,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:09,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:09,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:09,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:09,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:09,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:09,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:09,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:09,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:09,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:09,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:09,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,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 09:53:09,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:09,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:09,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:09,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,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 09:53:09,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:09,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:09,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:09,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,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 09:53:09,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:09,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:09,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,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 09:53:09,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:09,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:09,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:09,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,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 09:53:09,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:09,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:09,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:09,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:09,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:09,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,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 09:53:09,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:09,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:09,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:09,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,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 09:53:09,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:09,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:09,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:09,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,854 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 09:53:09,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,855 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,856 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:09,856 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:09,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,857 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:09,857 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 09:53:09,857 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,860 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2018-11-23 09:53:09,860 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 09:53:09,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,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 09:53:09,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,891 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:09,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,891 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,892 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:09,892 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:09,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,895 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:09,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,895 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,896 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:09,896 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:09,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,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 09:53:09,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,900 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,900 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:09,901 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:09,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,904 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,905 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:09,905 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:09,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,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 09:53:09,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,909 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,910 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:09,910 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:09,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,914 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,916 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:09,916 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:09,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,927 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,928 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:09,928 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:09,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,931 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,932 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:09,932 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:09,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,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 09:53:09,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,936 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:09,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,936 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,937 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:09,937 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:09,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,940 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,941 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:09,941 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:09,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,942 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,943 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:09,943 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:09,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,944 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,945 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:09,945 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:09,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,947 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,948 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:09,948 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:09,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:09,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,949 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,950 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 09:53:09,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:09,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,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 09:53:09,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:09,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,951 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,951 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 09:53:09,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:09,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:09,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,952 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,952 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 09:53:09,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:09,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,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 09:53:09,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:09,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,953 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,954 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 09:53:09,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:09,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,955 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,955 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:09,955 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:09,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:09,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,957 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,957 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 09:53:09,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:09,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,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 09:53:09,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,958 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,959 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:09,959 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:09,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:09,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,962 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,962 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 09:53:09,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:09,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,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 09:53:09,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:09,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,963 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,963 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 09:53:09,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:09,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,965 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:09,965 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:09,965 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:09,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,967 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 09:53:09,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:09,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:09,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:09,968 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:09,968 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:09,968 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:09,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:09,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 09:53:09,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:09,970 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:09,970 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 09:53:09,970 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:09,974 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2018-11-23 09:53:09,974 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-23 09:53:10,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,005 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:10,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,006 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,006 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 09:53:10,006 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:10,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,010 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:10,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,011 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,011 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 09:53:10,012 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:10,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,016 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,017 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:10,017 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:10,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,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 09:53:10,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,022 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,022 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:10,022 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:10,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,027 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,028 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:10,028 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:10,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,034 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,036 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:10,036 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:10,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,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 09:53:10,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,049 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,050 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:10,050 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:10,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,055 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,056 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:10,056 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:10,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,060 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:10,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,061 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,061 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 09:53:10,062 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:10,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,066 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,066 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:10,066 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:10,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,069 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,069 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:10,069 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:10,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,071 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,072 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:10,072 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:10,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,074 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,075 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:10,075 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:10,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:10,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,077 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,077 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 09:53:10,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:10,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:10,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,079 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,079 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 09:53:10,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:10,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:10,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,080 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,081 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 09:53:10,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:10,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:10,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,082 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,082 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 09:53:10,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:10,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,084 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,084 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:10,084 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:10,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:10,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,086 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,087 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 09:53:10,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:10,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,088 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,089 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:10,089 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:10,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:10,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,092 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,092 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 09:53:10,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:10,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:10,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,094 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,094 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 09:53:10,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:10,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,095 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:10,096 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:10,096 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:10,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,097 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 09:53:10,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,098 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,099 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:10,099 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:10,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,101 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:10,101 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 09:53:10,101 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,106 INFO L402 nArgumentSynthesizer]: We have 50 Motzkin's Theorem applications. [2018-11-23 09:53:10,106 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2018-11-23 09:53:10,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,144 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:10,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,144 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,145 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 09:53:10,145 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:10,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,150 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:10,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,151 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,152 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 09:53:10,152 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:10,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,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 09:53:10,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,157 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,158 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:10,158 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:10,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,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 09:53:10,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,164 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,165 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:10,165 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:10,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,171 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,172 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:10,172 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:10,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,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 09:53:10,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,179 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,182 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:10,183 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:10,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,199 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,200 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:10,200 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:10,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,206 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,207 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:10,207 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:10,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,213 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:10,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,213 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,214 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 09:53:10,215 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:10,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,220 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,221 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:10,221 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:10,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,223 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,223 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:10,224 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:10,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,226 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,226 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:10,226 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:10,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,229 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,230 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:10,230 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:10,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:10,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,232 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,233 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 09:53:10,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:10,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:10,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,234 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,234 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 09:53:10,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:10,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:10,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,236 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,236 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 09:53:10,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:10,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:10,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,238 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,238 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 09:53:10,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:10,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,239 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,240 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:10,240 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:10,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:10,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,242 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,243 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 09:53:10,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:10,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,244 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,245 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:10,245 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:10,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:10,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,249 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,249 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 09:53:10,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:10,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:10,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,251 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,251 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 09:53:10,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:10,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,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 09:53:10,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:10,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,252 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:10,253 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:10,253 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:10,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,255 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 09:53:10,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:10,256 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 09:53:10,256 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 09:53:10,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:10,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:10,256 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:10,257 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:10,257 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:10,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:10,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 09:53:10,259 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 09:53:10,259 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 09:53:10,259 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:10,259 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 09:53:10,259 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:10,263 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2018-11-23 09:53:10,263 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 09:53:10,315 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 09:53:10,354 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 09:53:10,354 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 09:53:10,355 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 09:53:10,356 INFO L440 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2018-11-23 09:53:10,356 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 09:53:10,356 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-phase ranking function: f0 = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_6 f1 = 1*v_rep(ite ULTIMATE.start_main_#t~short9 1 0)_6 Supporting invariants [] [2018-11-23 09:53:10,578 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 09:53:10,580 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 09:53:10,580 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 09:53:10,580 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 09:53:10,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:53:10,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:10,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:10,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 09:53:10,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:10,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:10,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 09:53:10,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:10,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:10,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:10,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-23 09:53:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:53:10,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:10,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:10,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-11-23 09:53:10,696 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:10,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 09:53:10,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:10,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-23 09:53:10,706 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 09:53:10,707 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:10,710 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:10,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:10,784 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:10,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-11-23 09:53:10,787 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:10,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-23 09:53:10,788 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:10,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 09:53:10,799 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 09:53:10,799 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:10,803 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:10,808 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:10,833 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:10,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-11-23 09:53:10,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:10,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 09:53:10,836 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:10,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-23 09:53:10,846 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 09:53:10,846 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:10,849 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:10,853 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:10,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 09:53:10,871 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:244, output treesize:67 [2018-11-23 09:53:10,907 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 09:53:10,908 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 09:53:10,908 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 112 transitions. cyclomatic complexity: 26 Second operand 5 states. [2018-11-23 09:53:11,064 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 112 transitions. cyclomatic complexity: 26. Second operand 5 states. Result 196 states and 234 transitions. Complement of second has 8 states. [2018-11-23 09:53:11,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 09:53:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 09:53:11,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 09:53:11,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-23 09:53:11,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:11,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 20 letters. Loop has 7 letters. [2018-11-23 09:53:11,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:11,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 14 letters. [2018-11-23 09:53:11,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:11,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 234 transitions. [2018-11-23 09:53:11,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-11-23 09:53:11,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 175 states and 210 transitions. [2018-11-23 09:53:11,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-23 09:53:11,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-23 09:53:11,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 210 transitions. [2018-11-23 09:53:11,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 09:53:11,071 INFO L705 BuchiCegarLoop]: Abstraction has 175 states and 210 transitions. [2018-11-23 09:53:11,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 210 transitions. [2018-11-23 09:53:11,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 159. [2018-11-23 09:53:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-23 09:53:11,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 194 transitions. [2018-11-23 09:53:11,077 INFO L728 BuchiCegarLoop]: Abstraction has 159 states and 194 transitions. [2018-11-23 09:53:11,077 INFO L608 BuchiCegarLoop]: Abstraction has 159 states and 194 transitions. [2018-11-23 09:53:11,077 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 09:53:11,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 194 transitions. [2018-11-23 09:53:11,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-11-23 09:53:11,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:53:11,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:53:11,079 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-23 09:53:11,079 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:53:11,079 INFO L794 eck$LassoCheckResult]: Stem: 2797#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2790#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 2791#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2834#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2860#L551-3 main_#t~short9 := main_#t~short7; 2858#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2855#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 2856#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2907#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 2905#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2906#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2926#L551-3 main_#t~short9 := main_#t~short7; 2899#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2900#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 2810#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2835#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 2802#L554-2 [2018-11-23 09:53:11,079 INFO L796 eck$LassoCheckResult]: Loop: 2802#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2803#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2948#L551-3 main_#t~short9 := main_#t~short7; 2796#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2841#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 2819#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2820#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 2802#L554-2 [2018-11-23 09:53:11,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:11,080 INFO L82 PathProgramCache]: Analyzing trace with hash -996537471, now seen corresponding path program 1 times [2018-11-23 09:53:11,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:53:11,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:53:11,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:11,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:53:11,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:11,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:11,100 INFO L82 PathProgramCache]: Analyzing trace with hash -334846251, now seen corresponding path program 2 times [2018-11-23 09:53:11,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:53:11,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:53:11,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:11,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:53:11,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:11,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:11,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1135913813, now seen corresponding path program 2 times [2018-11-23 09:53:11,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:53:11,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:53:11,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:11,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:53:11,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:11,260 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2018-11-23 09:53:11,679 WARN L180 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 124 [2018-11-23 09:53:11,770 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:53:11,770 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:53:11,770 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:53:11,770 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:53:11,770 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 09:53:11,771 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:53:11,771 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:53:11,771 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:53:11,771 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration8_Lasso [2018-11-23 09:53:11,771 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:53:11,771 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:53:11,772 INFO 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 09:53:11,778 INFO 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 09:53:11,779 INFO 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 09:53:11,780 INFO 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 09:53:11,781 INFO 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 09:53:11,783 INFO 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 09:53:11,784 INFO 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 09:53:11,982 INFO 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 09:53:11,983 INFO 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 09:53:11,984 INFO 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 09:53:11,985 INFO 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 09:53:11,986 INFO 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 09:53:11,987 INFO 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 09:53:11,987 INFO 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 09:53:11,988 INFO 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 09:53:11,989 INFO 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 09:53:11,990 INFO 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 09:53:11,991 INFO 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 09:53:12,233 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:53:12,233 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 09:53:12,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:12,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:12,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:12,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:12,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:12,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:12,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:12,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:12,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:12,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:12,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:12,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:12,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:12,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:12,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:12,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:12,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:12,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:12,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:12,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:12,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:12,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:12,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:12,238 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:12,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:12,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:12,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:12,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:12,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:12,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:12,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:12,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:12,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:12,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:12,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:12,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:12,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:12,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:12,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:12,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:12,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:12,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:12,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:12,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:12,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:12,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:12,243 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 09:53:12,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:12,243 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 09:53:12,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:12,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:12,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:12,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:12,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:12,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:12,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:12,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:12,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:12,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:12,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:12,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:12,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:12,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:12,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:12,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:12,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:12,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:12,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:12,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:12,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:12,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:12,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:12,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:12,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:12,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:12,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:12,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:12,254 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:12,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:12,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:12,255 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:53:12,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:12,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:12,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:12,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:12,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:12,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:12,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:12,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:12,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:12,260 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 09:53:12,261 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 09:53:12,261 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 09:53:12,262 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 09:53:12,262 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 09:53:12,262 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 09:53:12,262 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_7) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_7 Supporting invariants [] [2018-11-23 09:53:12,396 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 09:53:12,398 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 09:53:12,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:53:12,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:12,437 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 09:53:12,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:12,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:12,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 09:53:12,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:12,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:12,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:12,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-23 09:53:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:53:12,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:12,538 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 09:53:12,538 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-23 09:53:12,538 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 159 states and 194 transitions. cyclomatic complexity: 46 Second operand 7 states. [2018-11-23 09:53:12,595 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 159 states and 194 transitions. cyclomatic complexity: 46. Second operand 7 states. Result 249 states and 297 transitions. Complement of second has 12 states. [2018-11-23 09:53:12,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 09:53:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 09:53:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-11-23 09:53:12,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 16 letters. Loop has 7 letters. [2018-11-23 09:53:12,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:12,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 23 letters. Loop has 7 letters. [2018-11-23 09:53:12,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:12,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 16 letters. Loop has 14 letters. [2018-11-23 09:53:12,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:12,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 249 states and 297 transitions. [2018-11-23 09:53:12,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-11-23 09:53:12,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 249 states to 219 states and 261 transitions. [2018-11-23 09:53:12,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-23 09:53:12,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-11-23 09:53:12,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 261 transitions. [2018-11-23 09:53:12,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 09:53:12,600 INFO L705 BuchiCegarLoop]: Abstraction has 219 states and 261 transitions. [2018-11-23 09:53:12,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 261 transitions. [2018-11-23 09:53:12,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 200. [2018-11-23 09:53:12,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-23 09:53:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 242 transitions. [2018-11-23 09:53:12,607 INFO L728 BuchiCegarLoop]: Abstraction has 200 states and 242 transitions. [2018-11-23 09:53:12,607 INFO L608 BuchiCegarLoop]: Abstraction has 200 states and 242 transitions. [2018-11-23 09:53:12,607 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 09:53:12,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 242 transitions. [2018-11-23 09:53:12,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-11-23 09:53:12,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:53:12,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:53:12,608 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2018-11-23 09:53:12,608 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:53:12,608 INFO L794 eck$LassoCheckResult]: Stem: 3409#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3403#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 3404#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3448#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 3478#L551-3 main_#t~short9 := main_#t~short7; 3477#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3421#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 3422#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 3419#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 3548#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3538#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 3539#L551-3 main_#t~short9 := main_#t~short7; 3540#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3537#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 3485#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 3486#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 3536#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3425#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 3426#L551-3 main_#t~short9 := main_#t~short7; 3581#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3488#L551-6 [2018-11-23 09:53:12,608 INFO L796 eck$LassoCheckResult]: Loop: 3488#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 3432#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 3433#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 3429#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3571#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 3570#L551-3 main_#t~short9 := main_#t~short7; 3567#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3488#L551-6 [2018-11-23 09:53:12,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:12,609 INFO L82 PathProgramCache]: Analyzing trace with hash 2054331691, now seen corresponding path program 3 times [2018-11-23 09:53:12,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:53:12,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:53:12,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:12,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:53:12,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:12,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:12,626 INFO L82 PathProgramCache]: Analyzing trace with hash -947985053, now seen corresponding path program 2 times [2018-11-23 09:53:12,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:53:12,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:53:12,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:12,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:53:12,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:12,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:12,633 INFO L82 PathProgramCache]: Analyzing trace with hash 742589689, now seen corresponding path program 4 times [2018-11-23 09:53:12,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:53:12,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:53:12,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:12,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:53:12,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:12,841 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2018-11-23 09:53:13,499 WARN L180 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 150 [2018-11-23 09:53:14,084 WARN L180 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 110 [2018-11-23 09:53:14,086 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:53:14,086 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:53:14,086 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:53:14,086 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:53:14,086 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 09:53:14,086 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:53:14,086 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:53:14,086 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:53:14,087 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration9_Lasso [2018-11-23 09:53:14,087 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:53:14,087 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:53:14,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:53:14,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:53:14,094 INFO 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 09:53:14,470 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2018-11-23 09:53:14,566 INFO 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 09:53:14,568 INFO 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 09:53:14,570 INFO 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 09:53:14,572 INFO 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 09:53:14,573 INFO 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 09:53:14,574 INFO 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 09:53:14,575 INFO 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 09:53:14,579 INFO 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 09:53:14,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:53:14,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:53:14,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:53:14,585 INFO 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 09:53:14,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:53:14,961 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:53:14,961 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 09:53:14,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:14,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:14,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:14,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:14,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:14,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:14,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:14,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:14,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 09:53:14,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:14,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:14,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:14,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:14,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:14,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:14,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:14,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 09:53:14,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:14,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:14,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:14,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:14,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:14,966 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:14,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:14,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 09:53:14,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:14,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:14,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:14,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:14,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:14,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:14,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:14,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:14,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:14,971 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:14,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:14,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:14,972 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:53:14,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:14,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:14,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:14,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:14,974 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:14,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:14,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:14,975 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:53:14,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:14,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:14,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:14,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:14,977 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:14,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:14,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:14,978 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:53:14,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:14,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:14,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:14,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:14,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:14,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:14,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:14,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:14,982 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:14,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:14,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 09:53:14,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:14,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:14,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:14,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:14,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:14,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:14,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:14,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 09:53:14,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:14,989 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:14,989 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 09:53:14,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:14,991 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 09:53:14,991 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:15,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:15,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:15,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:15,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:15,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:15,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:15,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,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 09:53:15,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:15,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:15,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:15,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:15,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:15,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:15,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,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 09:53:15,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:15,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:15,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:15,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,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 09:53:15,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:15,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:15,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:15,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,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 09:53:15,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:15,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:15,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,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 09:53:15,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:15,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:15,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:15,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:15,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:15,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,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 09:53:15,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:15,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:15,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,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 09:53:15,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:15,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:15,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:15,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:15,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:15,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:15,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:15,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,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 09:53:15,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:15,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:15,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,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 09:53:15,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:15,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:15,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:15,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:15,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:15,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,033 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 09:53:15,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,034 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,034 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,034 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,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 09:53:15,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,037 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,037 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,037 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,038 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,039 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,039 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,042 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,043 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,043 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,046 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:15,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,046 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,047 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,047 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,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 09:53:15,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,050 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:15,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,050 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,051 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,051 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,054 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:15,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,054 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,054 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,054 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,058 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,059 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,059 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,068 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,068 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,068 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,069 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:15,069 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 09:53:15,069 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,071 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2018-11-23 09:53:15,072 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 09:53:15,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,093 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,094 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,094 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,097 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,098 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,098 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,102 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,102 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,103 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,106 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,106 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,106 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,108 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,109 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,109 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,110 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,110 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,111 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,112 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,112 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 09:53:15,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,113 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,113 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 09:53:15,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,114 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,115 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,115 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,116 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,116 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 09:53:15,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,118 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,118 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 09:53:15,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,119 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,119 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,119 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,121 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,121 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 09:53:15,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,122 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,122 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 09:53:15,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,124 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,124 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 09:53:15,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,125 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,126 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,126 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,127 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 09:53:15,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,128 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,128 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,128 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:15,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,131 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,132 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,132 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:15,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,133 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,134 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,134 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:15,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,138 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,139 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,139 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:15,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,143 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:15,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,143 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,143 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 09:53:15,144 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:15,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,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 09:53:15,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,147 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:15,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,147 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,148 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 09:53:15,148 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:15,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,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 09:53:15,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,151 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:15,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,152 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,152 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 09:53:15,152 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:15,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,156 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,158 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,158 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:15,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,168 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,169 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,169 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:15,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,171 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:15,171 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 09:53:15,171 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,173 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2018-11-23 09:53:15,174 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-23 09:53:15,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,217 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,217 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,217 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:15,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,221 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,222 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,222 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:15,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,227 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,227 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,228 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:15,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,231 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,232 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,232 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:15,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,234 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,235 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,235 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:15,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,237 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,237 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,237 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:15,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,239 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,239 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 09:53:15,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,241 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,241 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 09:53:15,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,242 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,242 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,243 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:15,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,245 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,245 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 09:53:15,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,246 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,246 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 09:53:15,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,248 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,248 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,248 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:15,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,250 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,250 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 09:53:15,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,252 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,252 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 09:53:15,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,253 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,253 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 09:53:15,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,255 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 09:53:15,255 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,255 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 09:53:15,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,257 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 09:53:15,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,257 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,258 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:15,258 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:15,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,261 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,262 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:15,262 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:15,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,264 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,265 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:15,265 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:15,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,269 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,270 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:15,270 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:15,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,275 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:15,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,275 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,276 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 09:53:15,276 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:15,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,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 09:53:15,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,280 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:15,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,280 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,281 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 09:53:15,281 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:15,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,286 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:15,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,286 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,287 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 09:53:15,287 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:15,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,291 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,294 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:15,294 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:15,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,306 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,307 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:15,307 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:15,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,308 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:15,309 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 09:53:15,309 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,312 INFO L402 nArgumentSynthesizer]: We have 50 Motzkin's Theorem applications. [2018-11-23 09:53:15,312 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2018-11-23 09:53:15,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,353 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,353 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:15,354 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:15,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,358 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,359 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:15,359 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:15,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,365 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,366 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:15,366 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:15,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,370 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,371 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:15,371 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:15,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,374 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,374 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:15,374 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:15,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,376 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,377 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:15,377 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:15,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,379 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,379 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 09:53:15,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,380 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,380 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 09:53:15,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,382 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,382 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:15,382 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:15,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,389 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,389 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 09:53:15,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,391 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,391 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 09:53:15,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,392 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,393 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:15,393 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:15,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,415 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,415 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 09:53:15,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,417 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,417 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 09:53:15,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:15,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,418 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,418 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 09:53:15,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:15,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:15,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,420 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 09:53:15,420 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 09:53:15,420 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 09:53:15,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,427 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 09:53:15,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,446 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 09:53:15,447 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 09:53:15,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,447 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,447 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,447 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,450 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 09:53:15,450 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 09:53:15,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,450 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,451 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,451 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,453 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 09:53:15,453 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 09:53:15,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,453 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,454 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,454 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,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 09:53:15,457 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 09:53:15,457 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 09:53:15,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,477 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,478 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,478 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,482 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 09:53:15,482 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 09:53:15,482 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:15,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,482 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,483 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,483 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,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 09:53:15,486 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 09:53:15,486 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 09:53:15,486 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:15,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,487 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,487 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,487 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,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 09:53:15,491 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 09:53:15,491 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 09:53:15,491 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:15,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,491 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,492 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 09:53:15,492 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,513 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 09:53:15,513 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 09:53:15,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,513 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,515 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,515 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,525 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 09:53:15,525 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 09:53:15,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:15,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:15,525 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,525 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 09:53:15,526 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 09:53:15,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:15,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:15,527 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 09:53:15,527 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 09:53:15,528 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:15,528 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 09:53:15,528 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 09:53:15,530 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2018-11-23 09:53:15,530 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 09:53:15,574 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 09:53:15,608 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 09:53:15,608 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 09:53:15,609 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 09:53:15,610 INFO L440 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2018-11-23 09:53:15,610 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 09:53:15,610 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-phase ranking function: f0 = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_8 f1 = 1*v_rep(ite ULTIMATE.start_main_#t~short9 1 0)_8 Supporting invariants [] [2018-11-23 09:53:16,081 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 09:53:16,083 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 09:53:16,083 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 09:53:16,083 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 09:53:16,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:53:16,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:16,130 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 09:53:16,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:16,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:16,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 09:53:16,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-23 09:53:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:53:16,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:16,199 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:16,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-11-23 09:53:16,202 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:16,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-23 09:53:16,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 09:53:16,226 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 09:53:16,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,329 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:16,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-11-23 09:53:16,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:16,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 09:53:16,333 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-23 09:53:16,347 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 09:53:16,348 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,353 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,358 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:16,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-11-23 09:53:16,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:16,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 09:53:16,392 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,511 INFO L303 Elim1Store]: Index analysis took 111 ms [2018-11-23 09:53:16,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-23 09:53:16,513 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 09:53:16,513 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,517 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,538 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 09:53:16,559 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:244, output treesize:67 [2018-11-23 09:53:16,590 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 09:53:16,590 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 09:53:16,590 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 200 states and 242 transitions. cyclomatic complexity: 56 Second operand 5 states. [2018-11-23 09:53:16,668 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 200 states and 242 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 302 states and 359 transitions. Complement of second has 8 states. [2018-11-23 09:53:16,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 09:53:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 09:53:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 09:53:16,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 20 letters. Loop has 7 letters. [2018-11-23 09:53:16,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:16,670 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 09:53:16,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:53:16,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:16,702 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 09:53:16,706 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:16,707 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:16,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 09:53:16,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-23 09:53:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:53:16,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:16,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:16,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-11-23 09:53:16,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:16,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 09:53:16,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-23 09:53:16,779 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 09:53:16,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,783 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,863 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:16,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-11-23 09:53:16,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:16,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 09:53:16,866 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-23 09:53:16,879 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 09:53:16,879 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,884 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,890 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:16,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-11-23 09:53:16,917 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:16,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-23 09:53:16,918 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 09:53:16,928 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 09:53:16,928 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,932 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,937 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:16,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 09:53:16,954 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:244, output treesize:67 [2018-11-23 09:53:16,980 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 09:53:16,980 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 09:53:16,981 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 200 states and 242 transitions. cyclomatic complexity: 56 Second operand 5 states. [2018-11-23 09:53:17,047 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 200 states and 242 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 302 states and 359 transitions. Complement of second has 8 states. [2018-11-23 09:53:17,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 09:53:17,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 09:53:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 09:53:17,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 20 letters. Loop has 7 letters. [2018-11-23 09:53:17,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:17,048 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 09:53:17,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:53:17,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:17,091 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 09:53:17,096 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:17,096 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:17,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 09:53:17,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:17,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:17,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:17,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-23 09:53:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:53:17,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:17,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:17,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-11-23 09:53:17,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:17,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-23 09:53:17,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:17,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 09:53:17,163 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 09:53:17,163 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:17,167 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:17,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:17,245 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:17,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-11-23 09:53:17,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:17,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 09:53:17,249 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:17,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-23 09:53:17,260 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 09:53:17,260 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:17,265 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:17,271 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:17,295 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:17,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-11-23 09:53:17,297 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:17,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 09:53:17,298 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:17,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-23 09:53:17,307 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 09:53:17,307 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:17,310 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:17,315 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:17,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 09:53:17,332 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:244, output treesize:67 [2018-11-23 09:53:17,357 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 09:53:17,357 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 09:53:17,358 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 200 states and 242 transitions. cyclomatic complexity: 56 Second operand 5 states. [2018-11-23 09:53:17,423 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 200 states and 242 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 411 states and 491 transitions. Complement of second has 9 states. [2018-11-23 09:53:17,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 09:53:17,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 09:53:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-23 09:53:17,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 20 letters. Loop has 7 letters. [2018-11-23 09:53:17,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:17,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 27 letters. Loop has 7 letters. [2018-11-23 09:53:17,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:17,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 20 letters. Loop has 14 letters. [2018-11-23 09:53:17,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:17,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 411 states and 491 transitions. [2018-11-23 09:53:17,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-23 09:53:17,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 411 states to 255 states and 305 transitions. [2018-11-23 09:53:17,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-23 09:53:17,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-23 09:53:17,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 255 states and 305 transitions. [2018-11-23 09:53:17,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 09:53:17,429 INFO L705 BuchiCegarLoop]: Abstraction has 255 states and 305 transitions. [2018-11-23 09:53:17,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states and 305 transitions. [2018-11-23 09:53:17,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-11-23 09:53:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-23 09:53:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 274 transitions. [2018-11-23 09:53:17,441 INFO L728 BuchiCegarLoop]: Abstraction has 226 states and 274 transitions. [2018-11-23 09:53:17,441 INFO L608 BuchiCegarLoop]: Abstraction has 226 states and 274 transitions. [2018-11-23 09:53:17,441 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 09:53:17,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states and 274 transitions. [2018-11-23 09:53:17,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-11-23 09:53:17,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:53:17,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:53:17,442 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2018-11-23 09:53:17,442 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:53:17,443 INFO L794 eck$LassoCheckResult]: Stem: 5031#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5025#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 5026#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5104#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 5102#L551-3 main_#t~short9 := main_#t~short7; 5098#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 5095#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 5042#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 5162#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 5143#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5144#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 5021#L551-3 main_#t~short9 := main_#t~short7; 5022#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 5176#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 5194#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 5165#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 5166#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5155#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 5133#L551-3 main_#t~short9 := main_#t~short7; 5134#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 5055#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 5032#L552 [2018-11-23 09:53:17,443 INFO L796 eck$LassoCheckResult]: Loop: 5032#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 5033#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 5064#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5063#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 5061#L551-3 main_#t~short9 := main_#t~short7; 5062#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 5171#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 5032#L552 [2018-11-23 09:53:17,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:17,443 INFO L82 PathProgramCache]: Analyzing trace with hash -740226994, now seen corresponding path program 5 times [2018-11-23 09:53:17,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:53:17,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:53:17,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:17,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:53:17,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:17,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:17,459 INFO L82 PathProgramCache]: Analyzing trace with hash -745311761, now seen corresponding path program 3 times [2018-11-23 09:53:17,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:53:17,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:53:17,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:17,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:53:17,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:17,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:17,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1488185602, now seen corresponding path program 6 times [2018-11-23 09:53:17,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:53:17,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:53:17,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:17,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:53:17,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:17,599 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2018-11-23 09:53:18,111 WARN L180 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 141 [2018-11-23 09:53:18,188 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:53:18,188 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:53:18,188 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:53:18,188 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:53:18,188 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 09:53:18,188 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:53:18,188 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:53:18,189 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:53:18,189 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration10_Lasso [2018-11-23 09:53:18,189 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:53:18,189 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:53:18,190 INFO 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 09:53:18,192 INFO 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 09:53:18,193 INFO 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 09:53:18,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:53:18,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:53:18,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:53:18,197 INFO 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 09:53:18,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:53:18,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:53:18,200 INFO 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 09:53:18,201 INFO 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 09:53:18,202 INFO 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 09:53:18,374 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2018-11-23 09:53:18,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:53:18,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:53:18,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:53:18,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:53:18,451 INFO 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 09:53:18,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 09:53:18,747 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:53:18,747 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 09:53:18,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:18,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:18,748 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 09:53:18,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,748 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 09:53:18,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:18,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:18,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:18,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:18,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:18,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:18,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:18,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:18,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:18,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:18,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:18,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:18,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:18,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:18,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:18,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:18,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:18,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:18,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:18,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:18,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:18,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:18,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:18,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:18,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:18,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:18,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:18,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:18,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:18,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:18,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:18,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:18,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:18,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:18,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:18,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:18,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:18,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:18,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:18,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:18,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:18,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:18,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:18,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:18,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:18,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:18,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:18,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:18,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:18,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:18,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,773 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:18,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,773 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:53:18,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:18,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:18,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:18,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:18,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:18,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:18,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:18,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:18,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:18,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:18,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:18,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:18,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:18,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,788 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:18,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,789 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:53:18,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:18,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,791 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:18,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,792 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:53:18,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:18,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:18,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:18,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:18,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:18,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:18,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:18,794 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:18,794 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:18,796 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 09:53:18,798 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 09:53:18,798 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 09:53:18,798 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 09:53:18,798 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 09:53:18,799 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 09:53:18,799 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_9) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_9 Supporting invariants [] [2018-11-23 09:53:18,936 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 09:53:18,937 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 09:53:18,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:53:18,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:18,985 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 09:53:18,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:18,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:18,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 09:53:18,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-23 09:53:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:53:19,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:19,026 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:19,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-23 09:53:19,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:19,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 09:53:19,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-23 09:53:19,042 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 09:53:19,042 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,055 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-11-23 09:53:19,102 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 09:53:19,102 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 09:53:19,102 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 274 transitions. cyclomatic complexity: 62 Second operand 8 states. [2018-11-23 09:53:19,179 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 274 transitions. cyclomatic complexity: 62. Second operand 8 states. Result 339 states and 408 transitions. Complement of second has 12 states. [2018-11-23 09:53:19,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 09:53:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 09:53:19,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-23 09:53:19,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 21 letters. Loop has 7 letters. [2018-11-23 09:53:19,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:19,180 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 09:53:19,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:53:19,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:19,205 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 09:53:19,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:19,210 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:19,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 09:53:19,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-23 09:53:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:53:19,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:19,223 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:19,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-23 09:53:19,226 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:19,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 09:53:19,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-23 09:53:19,234 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 09:53:19,234 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,237 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,243 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-11-23 09:53:19,285 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 09:53:19,286 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 09:53:19,286 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 274 transitions. cyclomatic complexity: 62 Second operand 8 states. [2018-11-23 09:53:19,355 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 274 transitions. cyclomatic complexity: 62. Second operand 8 states. Result 347 states and 415 transitions. Complement of second has 14 states. [2018-11-23 09:53:19,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-23 09:53:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 09:53:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2018-11-23 09:53:19,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 21 letters. Loop has 7 letters. [2018-11-23 09:53:19,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:19,355 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 09:53:19,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:53:19,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:19,383 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 09:53:19,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:19,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:19,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 09:53:19,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-23 09:53:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:53:19,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:19,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:19,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-23 09:53:19,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:19,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 09:53:19,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-23 09:53:19,421 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 09:53:19,421 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,425 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:19,431 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-11-23 09:53:19,474 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 09:53:19,474 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 09:53:19,475 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 274 transitions. cyclomatic complexity: 62 Second operand 8 states. [2018-11-23 09:53:19,548 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 274 transitions. cyclomatic complexity: 62. Second operand 8 states. Result 538 states and 658 transitions. Complement of second has 14 states. [2018-11-23 09:53:19,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 09:53:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 09:53:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2018-11-23 09:53:19,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 21 letters. Loop has 7 letters. [2018-11-23 09:53:19,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:19,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-23 09:53:19,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:19,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 21 letters. Loop has 14 letters. [2018-11-23 09:53:19,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:19,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 538 states and 658 transitions. [2018-11-23 09:53:19,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2018-11-23 09:53:19,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 538 states to 329 states and 391 transitions. [2018-11-23 09:53:19,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-23 09:53:19,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-23 09:53:19,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 329 states and 391 transitions. [2018-11-23 09:53:19,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 09:53:19,554 INFO L705 BuchiCegarLoop]: Abstraction has 329 states and 391 transitions. [2018-11-23 09:53:19,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states and 391 transitions. [2018-11-23 09:53:19,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 266. [2018-11-23 09:53:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-11-23 09:53:19,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 323 transitions. [2018-11-23 09:53:19,561 INFO L728 BuchiCegarLoop]: Abstraction has 266 states and 323 transitions. [2018-11-23 09:53:19,561 INFO L608 BuchiCegarLoop]: Abstraction has 266 states and 323 transitions. [2018-11-23 09:53:19,561 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 09:53:19,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 266 states and 323 transitions. [2018-11-23 09:53:19,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2018-11-23 09:53:19,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 09:53:19,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 09:53:19,562 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2018-11-23 09:53:19,562 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1] [2018-11-23 09:53:19,562 INFO L794 eck$LassoCheckResult]: Stem: 6921#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6915#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 6916#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 6926#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 6911#L551-3 main_#t~short9 := main_#t~short7; 6912#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 6930#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 6931#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 6963#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 6964#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 6973#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 7012#L551-3 main_#t~short9 := main_#t~short7; 7003#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 7001#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 7002#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 6953#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 6954#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 7108#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 7111#L551-3 main_#t~short9 := main_#t~short7; 7084#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 6941#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 6942#L552 [2018-11-23 09:53:19,562 INFO L796 eck$LassoCheckResult]: Loop: 6942#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 7081#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 7080#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 7079#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 7078#L551-3 main_#t~short9 := main_#t~short7; 7077#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 7075#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 6943#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 6955#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 6951#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 6952#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 6947#L551-3 main_#t~short9 := main_#t~short7; 6948#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 6941#L551-6 assume !!main_#t~short9;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5; 6942#L552 [2018-11-23 09:53:19,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:19,563 INFO L82 PathProgramCache]: Analyzing trace with hash -740226994, now seen corresponding path program 7 times [2018-11-23 09:53:19,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:53:19,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:53:19,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:19,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:53:19,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:19,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:19,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1613777279, now seen corresponding path program 1 times [2018-11-23 09:53:19,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:53:19,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:53:19,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:19,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:53:19,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:19,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:19,587 INFO L82 PathProgramCache]: Analyzing trace with hash 950159116, now seen corresponding path program 8 times [2018-11-23 09:53:19,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:53:19,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:53:19,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:19,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:53:19,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:53:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:53:19,910 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 97 [2018-11-23 09:53:20,438 WARN L180 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 141 [2018-11-23 09:53:20,519 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 09:53:20,519 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 09:53:20,520 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 09:53:20,520 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 09:53:20,520 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 09:53:20,520 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 09:53:20,520 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 09:53:20,520 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 09:53:20,520 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration11_Lasso [2018-11-23 09:53:20,520 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 09:53:20,520 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 09:53:20,521 INFO 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 09:53:20,523 INFO 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 09:53:20,524 INFO 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 09:53:20,525 INFO 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 09:53:20,526 INFO 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 09:53:20,528 INFO 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 09:53:20,529 INFO 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 09:53:20,730 INFO 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 09:53:20,732 INFO 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 09:53:20,733 INFO 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 09:53:20,734 INFO 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 09:53:20,735 INFO 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 09:53:20,737 INFO 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 09:53:20,737 INFO 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 09:53:20,739 INFO 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 09:53:20,740 INFO 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 09:53:20,741 INFO 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 09:53:20,742 INFO 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 09:53:20,985 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 09:53:20,985 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 09:53:20,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 09:53:20,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:20,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:20,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:20,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:20,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:20,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:20,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:20,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 09:53:20,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:20,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:20,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:20,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:20,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:20,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:20,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:20,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:20,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:20,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:20,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:20,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:20,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:20,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:20,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:20,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:20,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 09:53:20,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:20,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:20,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:20,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:20,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:20,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:20,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:20,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:20,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:20,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:20,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:20,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:20,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:20,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:20,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:20,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:20,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:20,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:20,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:20,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 09:53:20,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:20,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:20,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:20,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 09:53:20,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 09:53:20,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:20,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 09:53:20,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:20,993 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:20,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:20,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:20,993 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:53:20,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:20,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:20,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:20,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:20,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:20,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:20,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:20,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:20,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:20,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:20,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:20,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:20,998 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 09:53:20,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:20,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:20,999 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 09:53:20,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:21,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:21,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:21,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:21,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:21,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:21,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:21,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:21,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:21,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 09:53:21,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 09:53:21,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 09:53:21,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 09:53:21,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 09:53:21,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 09:53:21,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 09:53:21,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 09:53:21,005 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 09:53:21,006 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 09:53:21,006 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 09:53:21,006 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 09:53:21,007 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 09:53:21,007 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 09:53:21,007 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_10) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_10 Supporting invariants [] [2018-11-23 09:53:21,165 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 09:53:21,167 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 09:53:21,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:53:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:53:21,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:21,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:21,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 09:53:21,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:21,214 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:21,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 09:53:21,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:21,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:21,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:21,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-23 09:53:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:53:21,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:53:21,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:21,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-23 09:53:21,246 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:21,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 09:53:21,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:21,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-23 09:53:21,256 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 09:53:21,256 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:21,259 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:21,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:21,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:21,266 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:18 [2018-11-23 09:53:21,320 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:21,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2018-11-23 09:53:21,323 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:53:21,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 09:53:21,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:21,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-23 09:53:21,333 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 09:53:21,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:53:21,337 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:21,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:21,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:53:21,346 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:64, output treesize:25 [2018-11-23 09:53:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 09:53:21,346 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 09:53:21,346 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 266 states and 323 transitions. cyclomatic complexity: 74 Second operand 8 states. [2018-11-23 09:53:21,425 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 266 states and 323 transitions. cyclomatic complexity: 74. Second operand 8 states. Result 632 states and 767 transitions. Complement of second has 11 states. [2018-11-23 09:53:21,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 09:53:21,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 09:53:21,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-11-23 09:53:21,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 21 letters. Loop has 14 letters. [2018-11-23 09:53:21,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:21,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 35 letters. Loop has 14 letters. [2018-11-23 09:53:21,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:21,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 21 letters. Loop has 28 letters. [2018-11-23 09:53:21,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 09:53:21,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 632 states and 767 transitions. [2018-11-23 09:53:21,434 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 09:53:21,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 632 states to 0 states and 0 transitions. [2018-11-23 09:53:21,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 09:53:21,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 09:53:21,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 09:53:21,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 09:53:21,434 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 09:53:21,434 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 09:53:21,434 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 09:53:21,434 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 09:53:21,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 09:53:21,435 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 09:53:21,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 09:53:21,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 09:53:21 BoogieIcfgContainer [2018-11-23 09:53:21,440 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 09:53:21,441 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 09:53:21,441 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 09:53:21,441 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 09:53:21,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:51:22" (3/4) ... [2018-11-23 09:53:21,444 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 09:53:21,445 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 09:53:21,445 INFO L168 Benchmark]: Toolchain (without parser) took 119385.31 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 533.2 MB). Free memory was 955.5 MB in the beginning and 1.3 GB in the end (delta: -354.4 MB). Peak memory consumption was 178.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:53:21,446 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:53:21,446 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2018-11-23 09:53:21,446 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 09:53:21,446 INFO L168 Benchmark]: Boogie Preprocessor took 16.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:53:21,446 INFO L168 Benchmark]: RCFGBuilder took 207.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 09:53:21,447 INFO L168 Benchmark]: BuchiAutomizer took 118789.52 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 402.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -212.8 MB). Peak memory consumption was 189.9 MB. Max. memory is 11.5 GB. [2018-11-23 09:53:21,447 INFO L168 Benchmark]: Witness Printer took 3.82 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:53:21,448 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 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 207.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 118789.52 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 402.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -212.8 MB). Peak memory consumption was 189.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.82 ms. Allocated memory is still 1.6 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (1 trivial, 6 deterministic, 4 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 4 locations. One deterministic module has 2-phase ranking function (if unknown-#memory_int-unknown[z][z] > 0 then 1 else 0), (if unknown-#memory_int-unknown[z][z] > 0 then unknown-#memory_int-unknown[z][z] else (if aux-*x > 0 && *y > 0 && *z > 0-aux then 1 else 0)) and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One nondeterministic module has 2-phase ranking function (if unknown-#memory_int-unknown[z][z] > 0 then 1 else 0), (if unknown-#memory_int-unknown[z][z] > 0 then unknown-#memory_int-unknown[z][z] else (if aux-*x > 0 && *y > 0 && *z > 0-aux then 1 else 0)) and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 118.7s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 16.0s. Construction of modules took 97.0s. Büchi inclusion checks took 5.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 174 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 266 states and ocurred in iteration 10. Nontrivial modules had stage [6, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 13/13 HoareTripleCheckerStatistics: 181 SDtfs, 345 SDslu, 128 SDs, 0 SdLazy, 527 SolverSat, 119 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 97.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso10 LassoPreprocessingBenchmarks: Lassos: inital432 mio100 ax105 hnf99 lsp82 ukn62 mio100 lsp36 div100 bol100 ite100 ukn100 eq189 hnf88 smp98 dnf114 smp91 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 42ms VariablesStem: 3 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 10 MotzkinApplications: 50 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...