./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrcat_reverse_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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-15/cstrcat_reverse_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 79c8f3e75568b724086e7997d923ad8ab07e6657 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:44:59,712 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:44:59,717 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:44:59,729 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:44:59,729 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:44:59,730 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:44:59,733 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:44:59,736 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:44:59,739 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:44:59,740 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:44:59,741 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:44:59,742 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:44:59,743 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:44:59,744 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:44:59,745 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:44:59,746 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:44:59,747 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:44:59,749 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:44:59,751 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:44:59,753 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:44:59,754 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:44:59,755 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:44:59,758 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:44:59,758 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:44:59,758 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:44:59,759 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:44:59,761 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:44:59,762 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:44:59,763 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:44:59,764 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:44:59,764 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:44:59,765 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:44:59,765 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:44:59,766 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:44:59,767 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:44:59,768 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:44:59,768 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:44:59,793 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:44:59,793 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:44:59,794 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:44:59,794 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:44:59,795 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:44:59,795 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:44:59,795 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:44:59,795 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:44:59,795 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:44:59,795 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:44:59,797 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:44:59,797 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:44:59,797 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:44:59,797 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:44:59,797 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:44:59,797 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:44:59,798 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:44:59,798 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:44:59,798 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:44:59,798 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:44:59,798 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:44:59,798 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:44:59,800 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:44:59,800 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:44:59,800 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:44:59,801 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:44:59,801 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:44:59,801 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:44:59,802 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:44:59,802 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 -> 79c8f3e75568b724086e7997d923ad8ab07e6657 [2019-01-14 02:44:59,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:44:59,851 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:44:59,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:44:59,861 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:44:59,862 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:44:59,862 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrcat_reverse_alloca_true-termination.c.i [2019-01-14 02:44:59,928 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c535a9294/ddf15e7d7ce44cfab190598136d6e525/FLAG709fbee72 [2019-01-14 02:45:00,451 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:45:00,452 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrcat_reverse_alloca_true-termination.c.i [2019-01-14 02:45:00,466 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c535a9294/ddf15e7d7ce44cfab190598136d6e525/FLAG709fbee72 [2019-01-14 02:45:00,694 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c535a9294/ddf15e7d7ce44cfab190598136d6e525 [2019-01-14 02:45:00,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:45:00,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:45:00,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:45:00,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:45:00,703 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:45:00,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:45:00" (1/1) ... [2019-01-14 02:45:00,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2132f636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:00, skipping insertion in model container [2019-01-14 02:45:00,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:45:00" (1/1) ... [2019-01-14 02:45:00,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:45:00,761 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:45:01,160 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:45:01,176 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:45:01,326 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:45:01,402 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:45:01,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:01 WrapperNode [2019-01-14 02:45:01,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:45:01,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:45:01,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:45:01,404 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:45:01,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:01" (1/1) ... [2019-01-14 02:45:01,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:01" (1/1) ... [2019-01-14 02:45:01,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:45:01,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:45:01,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:45:01,458 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:45:01,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:01" (1/1) ... [2019-01-14 02:45:01,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:01" (1/1) ... [2019-01-14 02:45:01,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:01" (1/1) ... [2019-01-14 02:45:01,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:01" (1/1) ... [2019-01-14 02:45:01,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:01" (1/1) ... [2019-01-14 02:45:01,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:01" (1/1) ... [2019-01-14 02:45:01,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:01" (1/1) ... [2019-01-14 02:45:01,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:45:01,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:45:01,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:45:01,495 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:45:01,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:01" (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-14 02:45:01,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:45:01,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:45:01,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:45:01,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:45:01,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:45:01,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:45:01,951 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:45:01,952 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:45:01,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:45:01 BoogieIcfgContainer [2019-01-14 02:45:01,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:45:01,954 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:45:01,954 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:45:01,958 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:45:01,959 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:45:01,960 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:45:00" (1/3) ... [2019-01-14 02:45:01,961 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e525138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:45:01, skipping insertion in model container [2019-01-14 02:45:01,961 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:45:01,961 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:01" (2/3) ... [2019-01-14 02:45:01,962 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e525138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:45:01, skipping insertion in model container [2019-01-14 02:45:01,962 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:45:01,962 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:45:01" (3/3) ... [2019-01-14 02:45:01,965 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcat_reverse_alloca_true-termination.c.i [2019-01-14 02:45:02,021 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:45:02,022 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:45:02,022 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:45:02,022 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:45:02,022 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:45:02,023 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:45:02,023 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:45:02,023 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:45:02,023 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:45:02,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 02:45:02,057 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:45:02,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:45:02,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:45:02,063 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:45:02,064 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:45:02,064 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:45:02,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 02:45:02,066 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:45:02,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:45:02,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:45:02,066 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:45:02,066 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:45:02,075 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet210, main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet210;havoc main_#t~nondet210;main_~length2~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~length3~0 := main_#t~nondet212;havoc main_#t~nondet212; 3#L377true assume !(main_~length1~0 < 1); 6#L377-2true assume !(main_~length2~0 < 2); 15#L380-1true assume !(main_~length3~0 < 1); 10#L383-1true assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - main_~length3~0), 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post206.base, cstrcat_#t~post206.offset, cstrcat_#t~mem205, cstrcat_#t~post207.base, cstrcat_#t~post207.offset, cstrcat_#t~post208.base, cstrcat_#t~post208.offset, cstrcat_#t~mem209, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 7#L367-3true [2019-01-14 02:45:02,076 INFO L796 eck$LassoCheckResult]: Loop: 7#L367-3true call cstrcat_#t~mem205 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); 4#L367-1true assume !!(0 != cstrcat_#t~mem205);havoc cstrcat_#t~mem205;cstrcat_#t~post206.base, cstrcat_#t~post206.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post206.base, cstrcat_#t~post206.offset - 1;havoc cstrcat_#t~post206.base, cstrcat_#t~post206.offset; 7#L367-3true [2019-01-14 02:45:02,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:45:02,084 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-01-14 02:45:02,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:45:02,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:45:02,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:45:02,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:45:02,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:45:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:45:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:45:02,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:45:02,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2019-01-14 02:45:02,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:45:02,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:45:02,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:45:02,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:45:02,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:45:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:45:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:45:02,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:45:02,273 INFO L82 PathProgramCache]: Analyzing trace with hash 180553748, now seen corresponding path program 1 times [2019-01-14 02:45:02,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:45:02,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:45:02,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:45:02,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:45:02,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:45:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:45:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:45:03,545 WARN L181 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 115 DAG size of output: 98 [2019-01-14 02:45:03,798 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-01-14 02:45:03,812 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:45:03,813 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:45:03,813 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:45:03,813 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:45:03,814 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:45:03,814 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:45:03,814 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:45:03,814 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:45:03,814 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcat_reverse_alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:45:03,815 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:45:03,815 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:45:03,844 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-14 02:45:03,870 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-14 02:45:03,879 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-14 02:45:03,882 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-14 02:45:03,887 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-14 02:45:03,892 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-14 02:45:03,896 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-14 02:45:03,905 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-14 02:45:03,909 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-14 02:45:04,469 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-01-14 02:45:04,528 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-14 02:45:04,546 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-14 02:45:04,549 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-14 02:45:04,551 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-14 02:45:04,553 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-14 02:45:04,556 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-14 02:45:04,558 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-14 02:45:04,574 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-14 02:45:04,577 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-14 02:45:04,579 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-14 02:45:05,444 WARN L181 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-14 02:45:05,564 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-14 02:45:05,646 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:45:05,651 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:45:05,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:45:05,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:05,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:05,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:05,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:05,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:05,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:05,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:05,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:05,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 [2019-01-14 02:45:05,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:05,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:05,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:05,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:05,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:05,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:05,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:05,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:45:05,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:05,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:05,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:05,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:05,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:05,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:05,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:05,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:05,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 [2019-01-14 02:45:05,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:05,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:05,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:05,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:05,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:05,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:05,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:05,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:05,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-14 02:45:05,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:05,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:05,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:05,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:05,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:05,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:05,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:05,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:45:05,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:05,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:05,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:05,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:05,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:05,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:05,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:05,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:05,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:45:05,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:05,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:05,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:05,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:05,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:05,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:05,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:05,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:05,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-14 02:45:05,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:05,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:05,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:05,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:05,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:05,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:05,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:05,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:05,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:45:05,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:05,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:05,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:05,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:05,698 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:05,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:05,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:05,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:45:05,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:05,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:05,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:05,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:05,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:05,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:05,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:05,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-14 02:45:05,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:05,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:05,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:05,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:05,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:05,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:05,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:05,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-14 02:45:05,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:05,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:05,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:05,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:05,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:05,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:05,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:05,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-14 02:45:05,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:05,756 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:45:05,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:05,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:05,767 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:45:05,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:05,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:05,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-14 02:45:05,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:05,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:05,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:05,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:05,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:05,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:05,916 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:45:05,964 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:45:05,965 INFO L444 ModelExtractionUtils]: 44 out of 49 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:45:05,971 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:45:05,972 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:45:05,973 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:45:05,973 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc214.base)_1, ULTIMATE.start_cstrcat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc214.base)_1 + 2*ULTIMATE.start_cstrcat_~s~0.offset Supporting invariants [] [2019-01-14 02:45:06,099 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-01-14 02:45:06,107 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:45:06,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:45:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:45:06,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:45:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:45:06,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:45:06,369 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 02:45:06,370 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-14 02:45:06,389 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-14 02:45:06,390 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-01-14 02:45:06,494 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 32 states and 42 transitions. Complement of second has 8 states. [2019-01-14 02:45:06,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:45:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:45:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2019-01-14 02:45:06,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:45:06,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:45:06,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-14 02:45:06,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:45:06,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:45:06,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:45:06,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2019-01-14 02:45:06,510 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:45:06,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-01-14 02:45:06,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:45:06,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:45:06,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:45:06,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:45:06,515 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:45:06,515 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:45:06,516 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:45:06,516 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:45:06,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:45:06,516 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:45:06,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:45:06,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:45:06 BoogieIcfgContainer [2019-01-14 02:45:06,523 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:45:06,524 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:45:06,524 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:45:06,524 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:45:06,526 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:45:01" (3/4) ... [2019-01-14 02:45:06,530 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:45:06,530 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:45:06,531 INFO L168 Benchmark]: Toolchain (without parser) took 5833.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:45:06,533 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:45:06,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 704.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:45:06,535 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.32 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:45:06,536 INFO L168 Benchmark]: Boogie Preprocessor took 37.25 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. [2019-01-14 02:45:06,537 INFO L168 Benchmark]: RCFGBuilder took 458.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:45:06,538 INFO L168 Benchmark]: BuchiAutomizer took 4569.31 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.5 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:45:06,539 INFO L168 Benchmark]: Witness Printer took 6.29 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. [2019-01-14 02:45:06,549 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 704.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.32 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.25 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 458.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4569.31 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.5 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Witness Printer took 6.29 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. * 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[__builtin_alloca(length2 * sizeof(char))] + 2 * s and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.0s. 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: 16 SDtfs, 15 SDslu, 7 SDs, 0 SdLazy, 8 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital198 mio100 ax100 hnf98 lsp96 ukn78 mio100 lsp51 div100 bol100 ite100 ukn100 eq189 hnf89 smp100 dnf181 smp97 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 94ms VariablesStem: 10 VariablesLoop: 3 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...