./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrncat_malloc_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/cstrncat_malloc_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 57af49b15bb2f44ef5afe346e632fe87804775c2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:46:42,761 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:46:42,763 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:46:42,773 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:46:42,773 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:46:42,774 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:46:42,776 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:46:42,778 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:46:42,779 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:46:42,780 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:46:42,781 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:46:42,781 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:46:42,782 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:46:42,783 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:46:42,787 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:46:42,788 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:46:42,789 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:46:42,790 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:46:42,792 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:46:42,794 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:46:42,795 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:46:42,796 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:46:42,798 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:46:42,799 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:46:42,799 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:46:42,800 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:46:42,801 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:46:42,802 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:46:42,802 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:46:42,803 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:46:42,804 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:46:42,804 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:46:42,805 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:46:42,805 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:46:42,806 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:46:42,807 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:46:42,807 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:46:42,830 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:46:42,831 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:46:42,833 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:46:42,833 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:46:42,834 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:46:42,834 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:46:42,834 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:46:42,834 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:46:42,834 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:46:42,834 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:46:42,835 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:46:42,836 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:46:42,836 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:46:42,836 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:46:42,837 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:46:42,837 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:46:42,837 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:46:42,837 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:46:42,837 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:46:42,837 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:46:42,838 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:46:42,840 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:46:42,840 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:46:42,840 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:46:42,840 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:46:42,841 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:46:42,841 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:46:42,841 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:46:42,842 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:46:42,842 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 -> 57af49b15bb2f44ef5afe346e632fe87804775c2 [2019-01-14 02:46:42,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:46:42,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:46:42,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:46:42,930 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:46:42,930 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:46:42,931 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrncat_malloc_true-termination.c.i [2019-01-14 02:46:42,986 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae46f7540/eb59b5f7342341919e6b7b4c8b3aa7a9/FLAG74a0e03bd [2019-01-14 02:46:43,499 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:46:43,500 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrncat_malloc_true-termination.c.i [2019-01-14 02:46:43,519 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae46f7540/eb59b5f7342341919e6b7b4c8b3aa7a9/FLAG74a0e03bd [2019-01-14 02:46:43,755 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae46f7540/eb59b5f7342341919e6b7b4c8b3aa7a9 [2019-01-14 02:46:43,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:46:43,759 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:46:43,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:46:43,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:46:43,763 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:46:43,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:46:43" (1/1) ... [2019-01-14 02:46:43,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37f0b80a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:43, skipping insertion in model container [2019-01-14 02:46:43,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:46:43" (1/1) ... [2019-01-14 02:46:43,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:46:43,814 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:46:44,136 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:46:44,146 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:46:44,291 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:46:44,372 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:46:44,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:44 WrapperNode [2019-01-14 02:46:44,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:46:44,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:46:44,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:46:44,374 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:46:44,382 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:46:44" (1/1) ... [2019-01-14 02:46:44,402 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:46:44" (1/1) ... [2019-01-14 02:46:44,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:46:44,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:46:44,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:46:44,432 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:46:44,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:44" (1/1) ... [2019-01-14 02:46:44,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:44" (1/1) ... [2019-01-14 02:46:44,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:44" (1/1) ... [2019-01-14 02:46:44,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:44" (1/1) ... [2019-01-14 02:46:44,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:44" (1/1) ... [2019-01-14 02:46:44,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:44" (1/1) ... [2019-01-14 02:46:44,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:44" (1/1) ... [2019-01-14 02:46:44,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:46:44,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:46:44,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:46:44,460 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:46:44,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:44" (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:46:44,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:46:44,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:46:44,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 02:46:44,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:46:44,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:46:44,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:46:44,920 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:46:44,921 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:46:44,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:46:44 BoogieIcfgContainer [2019-01-14 02:46:44,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:46:44,923 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:46:44,923 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:46:44,926 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:46:44,927 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:46:44,927 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:46:43" (1/3) ... [2019-01-14 02:46:44,928 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b9f33c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:46:44, skipping insertion in model container [2019-01-14 02:46:44,928 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:46:44,928 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:44" (2/3) ... [2019-01-14 02:46:44,929 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b9f33c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:46:44, skipping insertion in model container [2019-01-14 02:46:44,929 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:46:44,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:46:44" (3/3) ... [2019-01-14 02:46:44,931 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncat_malloc_true-termination.c.i [2019-01-14 02:46:44,976 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:46:44,977 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:46:44,977 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:46:44,977 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:46:44,977 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:46:44,978 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:46:44,978 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:46:44,978 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:46:44,978 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:46:44,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 02:46:45,010 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-14 02:46:45,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:46:45,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:46:45,016 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:46:45,016 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:46:45,017 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:46:45,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 02:46:45,019 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-14 02:46:45,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:46:45,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:46:45,021 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:46:45,021 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:46:45,027 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; 15#L381true assume !(main_~length1~0 < 1); 18#L381-2true assume !(main_~length2~0 < 1); 11#L384-1true assume !(main_~n~0 < 1); 6#L387-1true assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 8#L367-3true [2019-01-14 02:46:45,027 INFO L796 eck$LassoCheckResult]: Loop: 8#L367-3true call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 4#L367-1true assume !!(0 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205;cstrncat_#t~post206.base, cstrncat_#t~post206.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post206.base, 1 + cstrncat_#t~post206.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset; 8#L367-3true [2019-01-14 02:46:45,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:45,033 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-01-14 02:46:45,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:45,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:45,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:45,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:45,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:45,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:45,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2019-01-14 02:46:45,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:45,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:45,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:45,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:45,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:45,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:45,202 INFO L82 PathProgramCache]: Analyzing trace with hash 180553748, now seen corresponding path program 1 times [2019-01-14 02:46:45,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:45,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:45,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:45,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:45,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:45,486 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-14 02:46:46,413 WARN L181 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2019-01-14 02:46:46,878 WARN L181 SmtUtils]: Spent 460.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-01-14 02:46:46,907 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:46:46,908 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:46:46,912 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:46:46,912 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:46:46,913 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:46:46,913 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:46:46,913 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:46:46,913 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:46:46,913 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat_malloc_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:46:46,913 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:46:46,915 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:46:46,947 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:46:46,958 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:46:46,962 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:46:46,965 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:46:46,968 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:46:46,974 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:46:46,999 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:46:47,011 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:46:47,014 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:46:47,019 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:46:47,022 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:46:47,024 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:46:47,028 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:46:47,037 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:46:47,040 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:46:47,046 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:46:47,048 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:46:47,052 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:46:47,058 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:46:47,060 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:46:47,085 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:46:47,087 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:46:47,561 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-01-14 02:46:48,139 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-14 02:46:48,708 WARN L181 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-14 02:46:48,780 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:46:48,785 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:46:48,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:46:48,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:48,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:48,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:48,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:46:48,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:48,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:48,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:48,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:48,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:48,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:48,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:46:48,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:48,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:48,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:48,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:46:48,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:48,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:48,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:48,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:46:48,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:48,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:48,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:48,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:48,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:48,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:48,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:48,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:48,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:48,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:48,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:48,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:48,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:48,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:48,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:48,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:48,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:48,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:48,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:48,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:48,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:48,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:48,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:48,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:48,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:48,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:48,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:46:48,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:48,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:48,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:48,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:48,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:48,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:48,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:48,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:48,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:48,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:48,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:48,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:46:48,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:48,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:48,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:48,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:48,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:48,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:48,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:48,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:48,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:48,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:48,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:48,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:48,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:48,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:48,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:48,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:46:48,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:48,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:48,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:48,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:46:48,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:48,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:48,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:48,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:48,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:46:48,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:48,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:48,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:48,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:48,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:48,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:48,951 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:46:49,018 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:46:49,018 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:46:49,025 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:46:49,027 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:46:49,028 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:46:49,028 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_1, ULTIMATE.start_cstrncat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_1 - 1*ULTIMATE.start_cstrncat_~s~0.offset Supporting invariants [] [2019-01-14 02:46:49,170 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-14 02:46:49,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:46:49,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:49,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:46:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:49,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:46:49,333 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:46:49,347 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:46:49,348 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-01-14 02:46:49,503 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 53 states and 76 transitions. Complement of second has 7 states. [2019-01-14 02:46:49,504 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:46:49,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:46:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2019-01-14 02:46:49,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:46:49,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:46:49,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-14 02:46:49,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:46:49,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:46:49,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:46:49,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 76 transitions. [2019-01-14 02:46:49,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:46:49,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 20 states and 27 transitions. [2019-01-14 02:46:49,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:46:49,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:46:49,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-01-14 02:46:49,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:46:49,521 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-01-14 02:46:49,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-01-14 02:46:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-01-14 02:46:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 02:46:49,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-01-14 02:46:49,544 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-14 02:46:49,544 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-14 02:46:49,544 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:46:49,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-01-14 02:46:49,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:46:49,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:46:49,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:46:49,547 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:46:49,547 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:46:49,547 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 163#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; 164#L381 assume !(main_~length1~0 < 1); 169#L381-2 assume !(main_~length2~0 < 1); 179#L384-1 assume !(main_~n~0 < 1); 174#L387-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 175#L367-3 call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 165#L367-1 assume !(0 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205; 166#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 181#L369 assume !cstrncat_#t~short209; 177#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~mem208;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, 1 + cstrncat_#t~post211.offset;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 180#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 171#L369 [2019-01-14 02:46:49,547 INFO L796 eck$LassoCheckResult]: Loop: 171#L369 assume !cstrncat_#t~short209; 176#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~mem208;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, 1 + cstrncat_#t~post211.offset;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 170#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 171#L369 [2019-01-14 02:46:49,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:49,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1662025132, now seen corresponding path program 1 times [2019-01-14 02:46:49,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:49,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:49,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:49,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:49,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:49,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:46:49,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:46:49,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:46:49,612 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:46:49,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:49,612 INFO L82 PathProgramCache]: Analyzing trace with hash 76643, now seen corresponding path program 1 times [2019-01-14 02:46:49,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:49,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:49,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:49,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:49,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:49,657 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:46:49,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:46:49,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:46:49,658 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:46:49,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:46:49,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:46:49,662 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-14 02:46:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:46:49,677 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-01-14 02:46:49,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:46:49,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2019-01-14 02:46:49,684 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:46:49,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-01-14 02:46:49,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:46:49,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:46:49,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:46:49,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:46:49,684 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:46:49,685 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:46:49,685 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:46:49,685 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:46:49,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:46:49,685 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:46:49,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:46:49,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:46:49 BoogieIcfgContainer [2019-01-14 02:46:49,692 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:46:49,692 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:46:49,693 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:46:49,693 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:46:49,693 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:46:44" (3/4) ... [2019-01-14 02:46:49,697 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:46:49,697 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:46:49,698 INFO L168 Benchmark]: Toolchain (without parser) took 5939.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -150.7 MB). Peak memory consumption was 47.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:46:49,699 INFO L168 Benchmark]: CDTParser took 0.14 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-14 02:46:49,699 INFO L168 Benchmark]: CACSL2BoogieTranslator took 613.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:46:49,700 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.69 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:46:49,701 INFO L168 Benchmark]: Boogie Preprocessor took 28.54 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:46:49,702 INFO L168 Benchmark]: RCFGBuilder took 462.31 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: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:46:49,702 INFO L168 Benchmark]: BuchiAutomizer took 4769.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -32.2 MB). Peak memory consumption was 41.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:46:49,703 INFO L168 Benchmark]: Witness Printer took 4.56 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:46:49,709 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 613.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.69 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.54 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 462.31 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: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4769.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -32.2 MB). Peak memory consumption was 41.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.56 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[malloc(length1 * sizeof(char))] + -1 * s and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 4.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 37 SDtfs, 41 SDslu, 23 SDs, 0 SdLazy, 16 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax100 hnf98 lsp97 ukn76 mio100 lsp41 div100 bol100 ite100 ukn100 eq187 hnf88 smp100 dnf240 smp97 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...