./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/rec_strlen-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/termination-memory-alloca/rec_strlen-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 872559d907cc6e66a8bb0b951a033bd6c217aa9a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:53:39,702 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:53:39,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:53:39,724 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:53:39,725 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:53:39,726 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:53:39,727 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:53:39,729 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:53:39,731 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:53:39,732 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:53:39,733 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:53:39,733 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:53:39,734 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:53:39,736 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:53:39,737 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:53:39,737 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:53:39,739 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:53:39,741 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:53:39,743 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:53:39,744 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:53:39,746 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:53:39,747 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:53:39,750 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:53:39,750 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:53:39,750 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:53:39,751 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:53:39,752 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:53:39,753 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:53:39,754 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:53:39,755 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:53:39,755 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:53:39,757 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:53:39,757 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:53:39,757 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:53:39,758 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:53:39,759 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:53:39,759 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:53:39,776 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:53:39,776 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:53:39,778 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:53:39,778 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:53:39,778 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:53:39,778 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:53:39,778 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:53:39,779 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:53:39,779 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:53:39,779 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:53:39,779 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:53:39,779 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:53:39,779 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:53:39,781 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:53:39,781 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:53:39,781 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:53:39,781 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:53:39,781 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:53:39,781 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:53:39,782 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:53:39,782 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:53:39,783 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:53:39,783 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:53:39,783 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:53:39,783 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:53:39,783 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:53:39,784 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:53:39,784 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:53:39,786 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:53:39,786 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 872559d907cc6e66a8bb0b951a033bd6c217aa9a [2019-01-01 21:53:39,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:53:39,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:53:39,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:53:39,849 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:53:39,849 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:53:39,850 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/rec_strlen-alloca_true-termination.c.i [2019-01-01 21:53:39,910 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf8a97b42/34d9313eacde4328a20fa57669e3f321/FLAG78be7f60c [2019-01-01 21:53:40,448 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:53:40,449 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/rec_strlen-alloca_true-termination.c.i [2019-01-01 21:53:40,462 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf8a97b42/34d9313eacde4328a20fa57669e3f321/FLAG78be7f60c [2019-01-01 21:53:40,728 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf8a97b42/34d9313eacde4328a20fa57669e3f321 [2019-01-01 21:53:40,732 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:53:40,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:53:40,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:53:40,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:53:40,738 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:53:40,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:53:40" (1/1) ... [2019-01-01 21:53:40,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a5801be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:40, skipping insertion in model container [2019-01-01 21:53:40,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:53:40" (1/1) ... [2019-01-01 21:53:40,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:53:40,803 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:53:41,144 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:53:41,160 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:53:41,292 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:53:41,354 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:53:41,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:41 WrapperNode [2019-01-01 21:53:41,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:53:41,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:53:41,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:53:41,355 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:53:41,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:41" (1/1) ... [2019-01-01 21:53:41,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:41" (1/1) ... [2019-01-01 21:53:41,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:53:41,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:53:41,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:53:41,416 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:53:41,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:41" (1/1) ... [2019-01-01 21:53:41,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:41" (1/1) ... [2019-01-01 21:53:41,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:41" (1/1) ... [2019-01-01 21:53:41,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:41" (1/1) ... [2019-01-01 21:53:41,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:41" (1/1) ... [2019-01-01 21:53:41,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:41" (1/1) ... [2019-01-01 21:53:41,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:41" (1/1) ... [2019-01-01 21:53:41,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:53:41,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:53:41,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:53:41,446 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:53:41,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:41" (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 [2019-01-01 21:53:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:53:41,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:53:41,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:53:41,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:53:41,506 INFO L130 BoogieDeclarations]: Found specification of procedure strlen_rec [2019-01-01 21:53:41,506 INFO L138 BoogieDeclarations]: Found implementation of procedure strlen_rec [2019-01-01 21:53:41,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:53:41,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:53:41,853 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:53:41,854 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 21:53:41,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:53:41 BoogieIcfgContainer [2019-01-01 21:53:41,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:53:41,855 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:53:41,855 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:53:41,859 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:53:41,860 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:53:41,860 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:53:40" (1/3) ... [2019-01-01 21:53:41,861 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10bd2735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:53:41, skipping insertion in model container [2019-01-01 21:53:41,861 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:53:41,861 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:41" (2/3) ... [2019-01-01 21:53:41,862 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10bd2735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:53:41, skipping insertion in model container [2019-01-01 21:53:41,862 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:53:41,862 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:53:41" (3/3) ... [2019-01-01 21:53:41,864 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_strlen-alloca_true-termination.c.i [2019-01-01 21:53:41,934 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:53:41,935 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:53:41,935 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:53:41,936 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:53:41,936 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:53:41,936 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:53:41,936 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:53:41,937 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:53:41,937 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:53:41,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-01 21:53:41,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:53:41,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:53:41,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:53:41,991 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:53:41,992 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:53:41,992 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:53:41,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-01 21:53:41,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:53:41,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:53:41,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:53:41,994 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:53:41,995 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:53:42,004 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~ret6, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet4;havoc main_#t~nondet4; 6#L555true assume !(main_~length1~0 < 1); 10#L555-2true call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1); 14#L560true call main_#t~ret6 := strlen_rec(main_~nondetString1~0.base, main_~nondetString1~0.offset);< 3#strlen_recENTRYtrue [2019-01-01 21:53:42,004 INFO L796 eck$LassoCheckResult]: Loop: 3#strlen_recENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 1); 5#L548true assume !(0 == #t~mem2);havoc #t~mem2; 16#L551true call #t~ret3 := strlen_rec(~p.base, 1 + ~p.offset);< 3#strlen_recENTRYtrue [2019-01-01 21:53:42,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:42,011 INFO L82 PathProgramCache]: Analyzing trace with hash 28695762, now seen corresponding path program 1 times [2019-01-01 21:53:42,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:42,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:42,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:42,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:42,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:42,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:42,156 INFO L82 PathProgramCache]: Analyzing trace with hash 44820, now seen corresponding path program 1 times [2019-01-01 21:53:42,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:42,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:42,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:42,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:42,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:42,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:42,180 INFO L82 PathProgramCache]: Analyzing trace with hash 176968867, now seen corresponding path program 1 times [2019-01-01 21:53:42,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:42,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:42,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:42,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:42,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:42,533 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-01 21:53:42,915 WARN L181 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-01 21:53:43,084 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-01 21:53:43,202 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:53:43,203 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:53:43,203 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:53:43,204 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:53:43,204 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:53:43,204 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:53:43,204 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:53:43,204 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:53:43,207 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_strlen-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:53:43,207 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:53:43,208 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:53:43,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,557 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 21:53:43,705 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-01 21:53:43,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:43,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:44,196 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:53:44,201 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:53:44,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:44,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:44,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:44,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:44,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:44,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:44,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:44,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:44,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:44,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:44,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:44,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:44,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:44,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:44,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:44,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:44,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:44,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:44,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:44,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:44,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:44,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:44,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:44,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:44,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:44,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:44,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:44,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:44,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:44,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:44,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:44,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:44,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:44,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:44,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:44,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:44,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:44,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:44,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:44,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:44,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:44,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:44,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:44,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:44,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:44,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:44,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:44,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:44,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:44,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:44,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:44,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:44,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:44,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:44,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:44,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:44,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:44,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:44,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:44,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:44,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:44,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:44,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:44,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:44,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:44,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:44,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:44,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:44,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:44,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:44,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:44,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:44,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:44,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:44,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:44,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:44,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:44,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:44,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:44,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:44,260 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:53:44,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:44,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:44,264 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:53:44,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:44,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:44,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:44,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:44,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:44,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:44,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:44,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:44,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:44,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:44,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:44,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:44,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:44,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:44,293 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:53:44,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:44,294 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:53:44,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:44,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:44,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:44,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:44,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:44,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:44,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:44,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:44,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:44,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:44,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:44,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:44,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:44,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:44,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:44,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:44,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:44,418 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:53:44,465 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:53:44,468 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:53:44,470 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:53:44,473 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:53:44,473 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:53:44,477 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length strlen_rec_#in~p.base)_1, strlen_rec_#in~p.offset) = 1*v_rep(select #length strlen_rec_#in~p.base)_1 - 1*strlen_rec_#in~p.offset Supporting invariants [] [2019-01-01 21:53:44,508 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:53:44,525 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:53:44,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:44,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:44,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:53:44,843 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 [2019-01-01 21:53:44,844 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-01-01 21:53:44,962 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 30 states and 35 transitions. Complement of second has 8 states. [2019-01-01 21:53:44,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:53:44,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:53:44,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-01 21:53:44,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-01 21:53:44,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:44,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-01 21:53:44,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:44,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-01 21:53:44,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:44,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2019-01-01 21:53:44,979 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:53:44,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2019-01-01 21:53:44,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:53:44,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:53:44,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:53:44,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:53:44,985 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:53:44,985 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:53:44,987 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:53:44,987 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:53:44,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:53:44,987 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:53:44,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:53:44,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:53:44 BoogieIcfgContainer [2019-01-01 21:53:44,996 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:53:44,996 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:53:44,996 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:53:44,996 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:53:44,998 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:53:41" (3/4) ... [2019-01-01 21:53:45,002 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:53:45,003 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:53:45,004 INFO L168 Benchmark]: Toolchain (without parser) took 4271.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 948.7 MB in the beginning and 935.2 MB in the end (delta: 13.5 MB). Peak memory consumption was 132.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:53:45,005 INFO L168 Benchmark]: CDTParser took 0.15 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. [2019-01-01 21:53:45,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 620.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -149.5 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:53:45,007 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:53:45,009 INFO L168 Benchmark]: Boogie Preprocessor took 29.44 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:53:45,009 INFO L168 Benchmark]: RCFGBuilder took 409.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:53:45,010 INFO L168 Benchmark]: BuchiAutomizer took 3140.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 935.2 MB in the end (delta: 144.8 MB). Peak memory consumption was 144.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:53:45,012 INFO L168 Benchmark]: Witness Printer took 6.68 ms. Allocated memory is still 1.1 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:53:45,017 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.15 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 620.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -149.5 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.44 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 409.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3140.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 935.2 MB in the end (delta: 144.8 MB). Peak memory consumption was 144.8 MB. Max. memory is 11.5 GB. * Witness Printer took 6.68 ms. Allocated memory is still 1.1 GB. Free memory is still 935.2 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[p] + -1 * p and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 10 SDtfs, 12 SDslu, 3 SDs, 0 SdLazy, 10 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital90 mio100 ax120 hnf99 lsp77 ukn63 mio100 lsp50 div100 bol100 ite100 ukn100 eq166 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...