./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrcat-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_41ff88da-32df-41f1-8b7f-47c4d73290de/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_41ff88da-32df-41f1-8b7f-47c4d73290de/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_41ff88da-32df-41f1-8b7f-47c4d73290de/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_41ff88da-32df-41f1-8b7f-47c4d73290de/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrcat-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_41ff88da-32df-41f1-8b7f-47c4d73290de/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_41ff88da-32df-41f1-8b7f-47c4d73290de/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 20ffcafc6849eb5f9469bdb1ab705ebc8209d0d9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:02:49,703 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:02:49,704 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:02:49,714 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:02:49,715 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:02:49,715 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:02:49,716 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:02:49,717 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:02:49,718 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:02:49,719 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:02:49,719 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:02:49,719 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:02:49,720 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:02:49,721 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:02:49,721 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:02:49,722 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:02:49,722 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:02:49,723 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:02:49,725 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:02:49,726 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:02:49,727 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:02:49,728 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:02:49,730 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:02:49,730 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:02:49,731 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:02:49,731 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:02:49,732 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:02:49,733 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:02:49,734 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:02:49,734 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:02:49,734 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:02:49,735 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:02:49,735 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:02:49,735 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:02:49,736 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:02:49,736 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:02:49,736 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_41ff88da-32df-41f1-8b7f-47c4d73290de/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 11:02:49,748 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:02:49,749 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:02:49,749 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:02:49,750 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:02:49,750 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:02:49,750 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:02:49,750 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:02:49,750 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:02:49,750 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:02:49,751 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:02:49,751 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:02:49,751 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:02:49,751 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:02:49,751 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:02:49,751 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:02:49,751 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:02:49,751 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:02:49,752 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:02:49,752 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:02:49,752 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:02:49,752 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:02:49,752 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:02:49,752 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:02:49,752 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:02:49,753 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:02:49,753 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:02:49,753 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:02:49,753 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:02:49,754 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_41ff88da-32df-41f1-8b7f-47c4d73290de/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 -> 20ffcafc6849eb5f9469bdb1ab705ebc8209d0d9 [2018-11-10 11:02:49,774 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:02:49,783 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:02:49,785 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:02:49,786 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:02:49,787 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:02:49,787 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_41ff88da-32df-41f1-8b7f-47c4d73290de/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrcat-alloca_true-termination.c.i [2018-11-10 11:02:49,831 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_41ff88da-32df-41f1-8b7f-47c4d73290de/bin-2019/uautomizer/data/a9b329932/95d6386bc9484a98910391cc4b8b67fe/FLAGdfa8b0034 [2018-11-10 11:02:50,213 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:02:50,214 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_41ff88da-32df-41f1-8b7f-47c4d73290de/sv-benchmarks/c/termination-memory-alloca/cstrcat-alloca_true-termination.c.i [2018-11-10 11:02:50,221 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_41ff88da-32df-41f1-8b7f-47c4d73290de/bin-2019/uautomizer/data/a9b329932/95d6386bc9484a98910391cc4b8b67fe/FLAGdfa8b0034 [2018-11-10 11:02:50,231 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_41ff88da-32df-41f1-8b7f-47c4d73290de/bin-2019/uautomizer/data/a9b329932/95d6386bc9484a98910391cc4b8b67fe [2018-11-10 11:02:50,233 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:02:50,234 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:02:50,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:02:50,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:02:50,238 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:02:50,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:02:50" (1/1) ... [2018-11-10 11:02:50,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13190ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:50, skipping insertion in model container [2018-11-10 11:02:50,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:02:50" (1/1) ... [2018-11-10 11:02:50,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:02:50,280 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:02:50,481 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:02:50,491 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:02:50,519 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:02:50,554 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:02:50,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:50 WrapperNode [2018-11-10 11:02:50,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:02:50,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:02:50,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:02:50,556 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:02:50,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:50" (1/1) ... [2018-11-10 11:02:50,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:50" (1/1) ... [2018-11-10 11:02:50,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:02:50,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:02:50,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:02:50,645 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:02:50,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:50" (1/1) ... [2018-11-10 11:02:50,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:50" (1/1) ... [2018-11-10 11:02:50,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:50" (1/1) ... [2018-11-10 11:02:50,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:50" (1/1) ... [2018-11-10 11:02:50,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:50" (1/1) ... [2018-11-10 11:02:50,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:50" (1/1) ... [2018-11-10 11:02:50,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:50" (1/1) ... [2018-11-10 11:02:50,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:02:50,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:02:50,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:02:50,673 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:02:50,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_41ff88da-32df-41f1-8b7f-47c4d73290de/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:02:50,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 11:02:50,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 11:02:50,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:02:50,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:02:50,959 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:02:50,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:02:50 BoogieIcfgContainer [2018-11-10 11:02:50,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:02:50,960 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:02:50,960 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:02:50,963 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:02:50,964 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:02:50,964 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:02:50" (1/3) ... [2018-11-10 11:02:50,965 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@131791ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:02:50, skipping insertion in model container [2018-11-10 11:02:50,965 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:02:50,966 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:02:50" (2/3) ... [2018-11-10 11:02:50,966 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@131791ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:02:50, skipping insertion in model container [2018-11-10 11:02:50,966 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:02:50,966 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:02:50" (3/3) ... [2018-11-10 11:02:50,968 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcat-alloca_true-termination.c.i [2018-11-10 11:02:51,020 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:02:51,021 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:02:51,021 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:02:51,021 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:02:51,021 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:02:51,022 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:02:51,022 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:02:51,022 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:02:51,022 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:02:51,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 11:02:51,058 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-10 11:02:51,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:02:51,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:02:51,066 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:02:51,066 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 11:02:51,066 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:02:51,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 11:02:51,068 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-10 11:02:51,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:02:51,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:02:51,069 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:02:51,069 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 11:02:51,076 INFO L793 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 21#L560true assume !(main_~length1~0 < 1); 4#L560-2true assume !(main_~length2~0 < 2); 15#L563-1true assume !(main_~length3~0 < 1); 8#L566-1true assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 17#L572true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L572 20#L572-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1) * 1, 1); srcloc: L572-1 14#L573true assume { :begin_inline_cstrcat } true;cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 6#L550-4true [2018-11-10 11:02:51,076 INFO L795 eck$LassoCheckResult]: Loop: 6#L550-4true assume true; 23#L550-1true SUMMARY for call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); srcloc: L550-1 3#L550-2true assume !!(cstrcat_#t~mem2 != 0);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, cstrcat_#t~post3.offset + 1;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; 6#L550-4true [2018-11-10 11:02:51,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:02:51,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1302194828, now seen corresponding path program 1 times [2018-11-10 11:02:51,082 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:02:51,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:02:51,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:02:51,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:02:51,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:02:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:02:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:02:51,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:02:51,210 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 1 times [2018-11-10 11:02:51,210 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:02:51,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:02:51,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:02:51,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:02:51,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:02:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:02:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:02:51,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:02:51,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1541535321, now seen corresponding path program 1 times [2018-11-10 11:02:51,222 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:02:51,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:02:51,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:02:51,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:02:51,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:02:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:02:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:02:51,643 WARN L179 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 96 [2018-11-10 11:02:51,751 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-10 11:02:51,763 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:02:51,764 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:02:51,764 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:02:51,764 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:02:51,765 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:02:51,765 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:02:51,765 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:02:51,765 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:02:51,765 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-10 11:02:51,765 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:02:51,766 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:02:51,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:51,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-10 11:02:51,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-10 11:02:51,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:51,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:51,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:51,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-10 11:02:51,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:51,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:51,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:51,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:51,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:51,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:51,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:51,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:51,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:51,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:51,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:52,104 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2018-11-10 11:02:52,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:52,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:52,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:52,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:52,591 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:02:52,594 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:02:52,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:02:52,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:02:52,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:02:52,603 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:02:52,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:02:52,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:02:52,608 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:02:52,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:02:52,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:02:52,611 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:02:52,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:52,619 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:02:52,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:02:52,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:02:52,622 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:02:52,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:02:52,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:02:52,625 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:02:52,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:52,633 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:02:52,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:02:52,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:02:52,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:02:52,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:02:52,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:02:52,638 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:02:52,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:52,645 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:02:52,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:02:52,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:02:52,648 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:02:52,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:02:52,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:02:52,651 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:02:52,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:02:52,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:02:52,654 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:02:52,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:02:52,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:02:52,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:02:52,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:02:52,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:02:52,659 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:02:52,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:52,665 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:02:52,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:02:52,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:02:52,667 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:02:52,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:52,672 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,674 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:02:52,674 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:52,677 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:02:52,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:52,685 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,686 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:02:52,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,690 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:02:52,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:52,713 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:02:52,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:52,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:02:52,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,722 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:02:52,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,723 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:02:52,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:02:52,726 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:52,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:52,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:52,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:52,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:52,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:52,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:02:52,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:52,777 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:02:52,802 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 11:02:52,803 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 11:02:52,804 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:02:52,806 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:02:52,806 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:02:52,806 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1, ULTIMATE.start_cstrcat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1 - 1*ULTIMATE.start_cstrcat_~s~0.offset Supporting invariants [] [2018-11-10 11:02:52,853 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 11:02:52,857 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:02:52,859 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 11:02:52,860 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 11:02:52,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:02:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:02:52,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:02:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:02:52,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:02:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:02:52,958 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-10 11:02:52,959 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 5 states. [2018-11-10 11:02:53,032 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 5 states. Result 54 states and 65 transitions. Complement of second has 8 states. [2018-11-10 11:02:53,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 11:02:53,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 11:02:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2018-11-10 11:02:53,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-10 11:02:53,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:02:53,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-10 11:02:53,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:02:53,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-10 11:02:53,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:02:53,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 65 transitions. [2018-11-10 11:02:53,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 11:02:53,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 22 states and 26 transitions. [2018-11-10 11:02:53,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-10 11:02:53,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 11:02:53,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2018-11-10 11:02:53,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:02:53,051 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-10 11:02:53,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2018-11-10 11:02:53,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-11-10 11:02:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 11:02:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-11-10 11:02:53,072 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-10 11:02:53,072 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-10 11:02:53,072 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:02:53,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2018-11-10 11:02:53,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 11:02:53,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:02:53,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:02:53,073 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:02:53,074 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:02:53,074 INFO L793 eck$LassoCheckResult]: Stem: 195#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 194#L560 assume !(main_~length1~0 < 1); 186#L560-2 assume !(main_~length2~0 < 2); 187#L563-1 assume !(main_~length3~0 < 1); 191#L566-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 192#L572 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L572 199#L572-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1) * 1, 1); srcloc: L572-1 197#L573 assume { :begin_inline_cstrcat } true;cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 189#L550-4 assume true; 190#L550-1 SUMMARY for call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); srcloc: L550-1 183#L550-2 assume !(cstrcat_#t~mem2 != 0);havoc cstrcat_#t~mem2; 184#L552-5 [2018-11-10 11:02:53,074 INFO L795 eck$LassoCheckResult]: Loop: 184#L552-5 assume true; 188#L552 cstrcat_#t~post4.base, cstrcat_#t~post4.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post4.base, cstrcat_#t~post4.offset + 1;cstrcat_#t~post5.base, cstrcat_#t~post5.offset := cstrcat_~s2.base, cstrcat_~s2.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#t~post5.base, cstrcat_#t~post5.offset + 1; 196#L552-1 SUMMARY for call cstrcat_#t~mem6 := read~int(cstrcat_#t~post5.base, cstrcat_#t~post5.offset, 1); srcloc: L552-1 198#L552-2 SUMMARY for call write~int(cstrcat_#t~mem6, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, 1); srcloc: L552-2 200#L552-3 assume !!(cstrcat_#t~mem6 != 0);havoc cstrcat_#t~post5.base, cstrcat_#t~post5.offset;havoc cstrcat_#t~post4.base, cstrcat_#t~post4.offset;havoc cstrcat_#t~mem6; 184#L552-5 [2018-11-10 11:02:53,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:02:53,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1541535319, now seen corresponding path program 1 times [2018-11-10 11:02:53,074 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:02:53,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:02:53,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:02:53,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:02:53,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:02:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:02:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:02:53,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:02:53,100 INFO L82 PathProgramCache]: Analyzing trace with hash 71635474, now seen corresponding path program 1 times [2018-11-10 11:02:53,101 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:02:53,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:02:53,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:02:53,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:02:53,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:02:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:02:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:02:53,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:02:53,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1206755708, now seen corresponding path program 1 times [2018-11-10 11:02:53,111 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:02:53,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:02:53,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:02:53,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:02:53,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:02:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:02:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:02:53,427 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 101 [2018-11-10 11:02:53,513 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:02:53,513 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:02:53,513 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:02:53,513 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:02:53,513 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:02:53,513 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:02:53,513 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:02:53,513 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:02:53,514 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 11:02:53,514 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:02:53,514 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:02:53,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-10 11:02:53,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:53,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-10 11:02:53,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:53,829 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 96 [2018-11-10 11:02:53,942 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2018-11-10 11:02:53,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:53,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:53,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:53,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:53,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:53,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:53,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:53,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:53,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:53,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:53,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:53,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:53,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:53,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-10 11:02:53,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:53,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:53,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:53,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:02:54,391 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:02:54,391 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:02:54,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:54,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:54,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:02:54,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:54,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:54,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:54,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:02:54,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:02:54,393 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:54,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:54,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:54,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:02:54,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:54,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:54,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:54,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:02:54,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:02:54,399 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:54,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:54,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:54,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:02:54,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:54,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:54,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:54,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:02:54,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:02:54,401 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:54,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:54,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:54,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:54,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:54,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:54,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:02:54,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:54,405 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:54,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:54,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:54,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:54,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:54,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:54,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:02:54,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:54,418 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:54,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-10 11:02:54,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:54,419 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:02:54,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:54,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:54,421 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:02:54,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:54,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:54,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:54,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:54,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:54,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:54,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:54,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:02:54,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:54,435 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:54,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:54,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:54,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:54,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:54,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:54,438 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:02:54,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:54,440 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:54,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:54,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:54,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:54,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:54,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:54,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:02:54,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:54,444 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:54,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:54,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:54,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:54,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:54,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:54,451 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:02:54,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:54,453 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:54,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:54,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:54,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:54,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:54,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:54,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:02:54,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:54,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:54,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-10 11:02:54,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:54,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:54,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:54,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:54,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:02:54,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:54,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:54,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:54,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:54,472 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:02:54,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:54,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:54,473 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:02:54,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:54,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:54,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:54,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:54,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:02:54,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:54,484 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:02:54,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:54,485 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:02:54,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:02:54,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:02:54,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:02:54,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:02:54,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:02:54,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:02:54,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:02:54,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:02:54,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:02:54,521 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:02:54,544 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 11:02:54,544 INFO L444 ModelExtractionUtils]: 59 out of 64 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 11:02:54,545 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:02:54,546 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:02:54,546 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:02:54,546 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2, ULTIMATE.start_cstrcat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 - 1*ULTIMATE.start_cstrcat_~s~0.offset Supporting invariants [] [2018-11-10 11:02:54,607 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-11-10 11:02:54,609 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:02:54,609 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 11:02:54,610 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 11:02:54,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:02:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:02:54,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:02:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:02:54,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:02:54,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:02:54,704 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-10 11:02:54,704 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-10 11:02:54,768 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 24 states and 29 transitions. Complement of second has 8 states. [2018-11-10 11:02:54,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 11:02:54,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 11:02:54,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-10 11:02:54,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-10 11:02:54,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:02:54,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-10 11:02:54,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:02:54,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-10 11:02:54,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:02:54,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2018-11-10 11:02:54,774 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:02:54,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-11-10 11:02:54,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:02:54,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:02:54,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:02:54,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:02:54,775 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:02:54,775 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:02:54,775 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:02:54,775 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 11:02:54,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:02:54,776 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:02:54,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 11:02:54,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:02:54 BoogieIcfgContainer [2018-11-10 11:02:54,799 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:02:54,800 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:02:54,800 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:02:54,800 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:02:54,801 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:02:50" (3/4) ... [2018-11-10 11:02:54,803 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:02:54,804 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:02:54,804 INFO L168 Benchmark]: Toolchain (without parser) took 4570.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 193.5 MB). Free memory was 955.5 MB in the beginning and 1.2 GB in the end (delta: -231.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:02:54,805 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:02:54,806 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.73 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 934.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:02:54,806 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -207.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 11:02:54,807 INFO L168 Benchmark]: Boogie Preprocessor took 27.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:02:54,808 INFO L168 Benchmark]: RCFGBuilder took 286.37 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-10 11:02:54,808 INFO L168 Benchmark]: BuchiAutomizer took 3839.96 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -70.8 MB). Peak memory consumption was 290.0 MB. Max. memory is 11.5 GB. [2018-11-10 11:02:54,809 INFO L168 Benchmark]: Witness Printer took 3.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:02:54,813 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 320.73 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 934.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -207.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 286.37 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3839.96 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -70.8 MB). Peak memory consumption was 290.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 6 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 36 SDtfs, 54 SDslu, 46 SDs, 0 SdLazy, 28 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital217 mio100 ax108 hnf99 lsp89 ukn99 mio100 lsp44 div100 bol100 ite100 ukn100 eq195 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 6 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...