./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 32bit --witnessprinter.graph.data.programhash a42c021ebd0de645918b065980a1f8d912cba85d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:11:03,612 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:11:03,615 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:11:03,632 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:11:03,633 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:11:03,635 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:11:03,637 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:11:03,639 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:11:03,643 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:11:03,653 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:11:03,654 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:11:03,654 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:11:03,656 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:11:03,658 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:11:03,661 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:11:03,663 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:11:03,664 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:11:03,669 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:11:03,673 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:11:03,677 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:11:03,679 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:11:03,683 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:11:03,689 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:11:03,690 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:11:03,690 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:11:03,691 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:11:03,695 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:11:03,696 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:11:03,697 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:11:03,699 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:11:03,700 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:11:03,702 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:11:03,702 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:11:03,702 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:11:03,705 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:11:03,706 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:11:03,708 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:11:03,731 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:11:03,731 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:11:03,732 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:11:03,733 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:11:03,733 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:11:03,733 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:11:03,734 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:11:03,734 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:11:03,734 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:11:03,734 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:11:03,734 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:11:03,734 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:11:03,735 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:11:03,736 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:11:03,736 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:11:03,736 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:11:03,736 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:11:03,736 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:11:03,736 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:11:03,737 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:11:03,737 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:11:03,737 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:11:03,737 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:11:03,737 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:11:03,737 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:11:03,738 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:11:03,738 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:11:03,738 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:11:03,738 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:11:03,738 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:11:03,739 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:11:03,741 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:11:03,741 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a42c021ebd0de645918b065980a1f8d912cba85d [2018-11-29 00:11:03,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:11:03,790 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:11:03,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:11:03,798 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:11:03,798 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:11:03,799 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:03,868 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aceb03b3e/95208eb6cafd488596a2e7db81ad77d1/FLAGf2ec27c7d [2018-11-29 00:11:04,356 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:11:04,357 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:04,381 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aceb03b3e/95208eb6cafd488596a2e7db81ad77d1/FLAGf2ec27c7d [2018-11-29 00:11:04,657 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aceb03b3e/95208eb6cafd488596a2e7db81ad77d1 [2018-11-29 00:11:04,661 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:11:04,663 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:11:04,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:04,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:11:04,668 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:11:04,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:04" (1/1) ... [2018-11-29 00:11:04,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a26c5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:04, skipping insertion in model container [2018-11-29 00:11:04,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:04" (1/1) ... [2018-11-29 00:11:04,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:11:04,739 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:11:05,156 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:05,170 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:11:05,248 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:05,381 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:11:05,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:05 WrapperNode [2018-11-29 00:11:05,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:05,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:05,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:11:05,384 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:11:05,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:05" (1/1) ... [2018-11-29 00:11:05,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:05" (1/1) ... [2018-11-29 00:11:05,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:05,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:11:05,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:11:05,441 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:11:05,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:05" (1/1) ... [2018-11-29 00:11:05,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:05" (1/1) ... [2018-11-29 00:11:05,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:05" (1/1) ... [2018-11-29 00:11:05,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:05" (1/1) ... [2018-11-29 00:11:05,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:05" (1/1) ... [2018-11-29 00:11:05,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:05" (1/1) ... [2018-11-29 00:11:05,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:05" (1/1) ... [2018-11-29 00:11:05,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:11:05,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:11:05,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:11:05,473 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:11:05,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-29 00:11:05,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:11:05,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:11:05,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:11:05,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:11:05,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:11:05,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:11:05,941 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:11:05,942 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-29 00:11:05,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:05 BoogieIcfgContainer [2018-11-29 00:11:05,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:11:05,943 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:11:05,943 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:11:05,947 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:11:05,948 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:05,949 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:11:04" (1/3) ... [2018-11-29 00:11:05,950 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@706d87cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:05, skipping insertion in model container [2018-11-29 00:11:05,950 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:05,950 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:05" (2/3) ... [2018-11-29 00:11:05,951 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@706d87cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:05, skipping insertion in model container [2018-11-29 00:11:05,951 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:05,951 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:05" (3/3) ... [2018-11-29 00:11:05,953 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:06,025 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:11:06,026 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:11:06,026 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:11:06,026 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:11:06,027 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:11:06,027 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:11:06,027 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:11:06,027 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:11:06,028 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:11:06,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-29 00:11:06,066 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-29 00:11:06,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:06,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:06,075 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:06,075 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:11:06,075 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:11:06,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-29 00:11:06,077 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-29 00:11:06,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:06,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:06,078 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:06,078 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:11:06,088 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc 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_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 12#L561true assume !(main_~length~0 < 1); 16#L561-2true assume !(main_~n~0 < 1); 10#L564-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post2, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~post6, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 6#L546-2true [2018-11-29 00:11:06,088 INFO L796 eck$LassoCheckResult]: Loop: 6#L546-2true assume !!(cstrncpy_~n > 0);cstrncpy_#t~post2 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post2 - 1;havoc cstrncpy_#t~post2;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 3#L548true assume !(0 == cstrncpy_#t~mem5);havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~mem5; 6#L546-2true [2018-11-29 00:11:06,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:06,098 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-29 00:11:06,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:06,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:06,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:06,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:06,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:06,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:06,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2018-11-29 00:11:06,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:06,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:06,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:06,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:06,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:06,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:06,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2018-11-29 00:11:06,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:06,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:06,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:06,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:06,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:06,649 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-29 00:11:06,866 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-29 00:11:07,695 WARN L180 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2018-11-29 00:11:07,894 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-11-29 00:11:07,905 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:07,906 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:07,907 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:07,907 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:07,907 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:07,907 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:07,907 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:07,908 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:07,908 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-29 00:11:07,908 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:07,908 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:07,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:07,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:07,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:07,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:07,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:07,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:07,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:08,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:08,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:08,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:08,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:08,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:08,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:08,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:08,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:08,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:08,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:08,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:08,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:08,563 WARN L180 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2018-11-29 00:11:08,763 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2018-11-29 00:11:08,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:08,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:08,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:09,208 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-29 00:11:09,592 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-29 00:11:09,754 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:09,760 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:09,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:09,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:09,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:09,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:09,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:09,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:09,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:09,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:09,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:09,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:09,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:09,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:09,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:09,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:09,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:09,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:09,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:09,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:09,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:09,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:09,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:09,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:09,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:09,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:09,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:09,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:09,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:09,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:09,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:09,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:09,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:09,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:09,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:09,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:09,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:09,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:09,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:09,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:09,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:09,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:09,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:09,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:09,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:09,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:09,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:09,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:09,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:09,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:09,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:09,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:09,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:09,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:09,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,836 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:09,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,843 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:09,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:09,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:09,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:09,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:09,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:09,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:09,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:09,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:09,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:09,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:09,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:09,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:09,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:09,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:09,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:09,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:09,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:09,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:09,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:10,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:10,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:10,121 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:10,179 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:11:10,180 INFO L444 ModelExtractionUtils]: 48 out of 55 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-29 00:11:10,183 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:10,184 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:10,184 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:10,185 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1, ULTIMATE.start_cstrncpy_~dst~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 - 1*ULTIMATE.start_cstrncpy_~dst~0.offset Supporting invariants [] [2018-11-29 00:11:10,373 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-29 00:11:10,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:11:10,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:10,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:10,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:10,742 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-29 00:11:10,763 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-29 00:11:10,765 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2018-11-29 00:11:11,001 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 27 states and 37 transitions. Complement of second has 6 states. [2018-11-29 00:11:11,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-29 00:11:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:11:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-29 00:11:11,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-29 00:11:11,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:11,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-29 00:11:11,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:11,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-29 00:11:11,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:11,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 37 transitions. [2018-11-29 00:11:11,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:11:11,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 11 states and 14 transitions. [2018-11-29 00:11:11,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-29 00:11:11,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-29 00:11:11,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-29 00:11:11,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:11,019 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-29 00:11:11,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-29 00:11:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-11-29 00:11:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-29 00:11:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-29 00:11:11,047 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-29 00:11:11,047 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-29 00:11:11,047 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:11:11,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-29 00:11:11,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:11:11,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:11,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:11,049 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:11,049 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:11:11,049 INFO L794 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 148#L-1 havoc main_#res;havoc 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_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 149#L561 assume !(main_~length~0 < 1); 153#L561-2 assume !(main_~n~0 < 1); 151#L564-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post2, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~post6, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 152#L546-2 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post2 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post2 - 1;havoc cstrncpy_#t~post2;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 146#L548 assume 0 == cstrncpy_#t~mem5;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~mem5;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 144#L551-3 [2018-11-29 00:11:11,049 INFO L796 eck$LassoCheckResult]: Loop: 144#L551-3 cstrncpy_#t~post6 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post6 - 1; 145#L551-1 assume !!(0 != cstrncpy_#t~post6);havoc cstrncpy_#t~post6;cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post7.base, 1 + cstrncpy_#t~post7.offset;call write~int(0, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, 1);havoc cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset; 144#L551-3 [2018-11-29 00:11:11,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:11,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2018-11-29 00:11:11,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:11,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:11,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:11,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:11,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:11,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:11,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2018-11-29 00:11:11,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:11,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:11,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:11,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:11,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:11,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:11,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2018-11-29 00:11:11,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:11,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:11,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:11,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:11,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:11,892 WARN L180 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 125 [2018-11-29 00:11:12,073 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-11-29 00:11:12,077 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:12,078 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:12,078 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:12,078 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:12,078 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:12,078 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:12,078 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:12,078 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:12,078 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-29 00:11:12,078 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:12,078 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:12,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:12,621 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2018-11-29 00:11:12,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:13,308 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-29 00:11:13,536 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-29 00:11:13,635 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:13,635 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:13,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-29 00:11:13,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:13,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:13,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:13,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:13,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:13,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:13,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,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-29 00:11:13,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:13,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:13,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:13,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:13,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:13,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:13,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:13,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:13,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:13,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:13,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:13,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:13,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:13,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:13,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:13,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:13,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:13,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:13,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:13,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:13,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:13,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:13,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:13,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:13,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:13,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:13,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:13,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:13,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:13,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:13,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:13,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:13,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:13,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:13,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:13,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:13,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:13,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:13,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:13,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:13,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:13,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:13,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:13,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:13,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:13,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:13,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:13,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:13,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:13,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:13,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:13,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:13,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:13,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:13,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,773 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:13,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,778 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:13,778 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:13,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:13,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:13,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:13,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:13,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:13,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:13,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:13,804 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:11:13,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:13,816 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-29 00:11:13,819 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-29 00:11:14,040 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:14,172 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-29 00:11:14,173 INFO L444 ModelExtractionUtils]: 69 out of 81 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-11-29 00:11:14,173 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:14,176 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-29 00:11:14,176 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:14,176 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~us~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2) = -1*ULTIMATE.start_cstrncpy_~us~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2 Supporting invariants [] [2018-11-29 00:11:14,432 INFO L297 tatePredicateManager]: 13 out of 15 supporting invariants were superfluous and have been removed [2018-11-29 00:11:14,437 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:11:14,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:14,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:14,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:14,498 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-29 00:11:14,499 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2018-11-29 00:11:14,499 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-29 00:11:14,634 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 12 states and 16 transitions. Complement of second has 5 states. [2018-11-29 00:11:14,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-29 00:11:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:14,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-29 00:11:14,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-29 00:11:14,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:14,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-29 00:11:14,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:14,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-29 00:11:14,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:14,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2018-11-29 00:11:14,639 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:11:14,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-11-29 00:11:14,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:11:14,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:11:14,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:11:14,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:14,640 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:14,640 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:14,640 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:14,640 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:11:14,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:11:14,640 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:11:14,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:11:14,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:11:14 BoogieIcfgContainer [2018-11-29 00:11:14,647 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:11:14,647 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:11:14,648 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:11:14,648 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:11:14,648 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:05" (3/4) ... [2018-11-29 00:11:14,652 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:11:14,652 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:11:14,653 INFO L168 Benchmark]: Toolchain (without parser) took 9991.13 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.8 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -211.2 MB). Peak memory consumption was 96.6 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:14,654 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:14,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -176.7 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:14,655 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.86 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:14,656 INFO L168 Benchmark]: Boogie Preprocessor took 31.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:14,657 INFO L168 Benchmark]: RCFGBuilder took 469.34 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: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:14,658 INFO L168 Benchmark]: BuchiAutomizer took 8704.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -59.8 MB). Peak memory consumption was 112.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:14,659 INFO L168 Benchmark]: Witness Printer took 4.34 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:14,664 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 718.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -176.7 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.86 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 469.34 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: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8704.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -59.8 MB). Peak memory consumption was 112.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.34 ms. Allocated memory is still 1.3 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.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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[__builtin_alloca (n * sizeof(char))] + -1 * dst and consists of 4 locations. One deterministic module has affine ranking function -1 * us + unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 7.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 21 SDtfs, 23 SDslu, 11 SDs, 0 SdLazy, 12 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital233 mio100 ax100 hnf99 lsp97 ukn84 mio100 lsp49 div100 bol100 ite100 ukn100 eq202 hnf88 smp100 dnf116 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 373ms VariablesStem: 15 VariablesLoop: 10 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...