./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 025e0289c8e9b33528493c96bf0a22ba3200731b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:44:24,090 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:44:24,093 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:44:24,109 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:44:24,111 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:44:24,112 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:44:24,114 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:44:24,116 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:44:24,119 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:44:24,121 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:44:24,130 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:44:24,130 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:44:24,131 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:44:24,134 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:44:24,138 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:44:24,139 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:44:24,140 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:44:24,146 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:44:24,150 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:44:24,154 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:44:24,155 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:44:24,157 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:44:24,159 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:44:24,160 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:44:24,160 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:44:24,161 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:44:24,162 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:44:24,163 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:44:24,164 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:44:24,165 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:44:24,165 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:44:24,166 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:44:24,166 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:44:24,166 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:44:24,167 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:44:24,169 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:44:24,169 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 23:44:24,186 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:44:24,186 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:44:24,188 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:44:24,188 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:44:24,188 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:44:24,188 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:44:24,188 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:44:24,189 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:44:24,189 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:44:24,189 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:44:24,189 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:44:24,189 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:44:24,190 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:44:24,190 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:44:24,190 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:44:24,190 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:44:24,190 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:44:24,190 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:44:24,191 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:44:24,191 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:44:24,191 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:44:24,191 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:44:24,191 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:44:24,191 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:44:24,192 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:44:24,192 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:44:24,192 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:44:24,192 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:44:24,192 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:44:24,193 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:44:24,193 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:44:24,194 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:44:24,194 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 025e0289c8e9b33528493c96bf0a22ba3200731b [2018-11-28 23:44:24,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:44:24,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:44:24,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:44:24,255 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:44:24,255 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:44:24,256 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-11-28 23:44:24,322 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf0cfbd70/fe5ba8a4ebe24202807702e9cea4363d/FLAGd39d4e887 [2018-11-28 23:44:24,796 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:44:24,796 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-11-28 23:44:24,804 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf0cfbd70/fe5ba8a4ebe24202807702e9cea4363d/FLAGd39d4e887 [2018-11-28 23:44:25,138 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf0cfbd70/fe5ba8a4ebe24202807702e9cea4363d [2018-11-28 23:44:25,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:44:25,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:44:25,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:44:25,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:44:25,149 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:44:25,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:44:25" (1/1) ... [2018-11-28 23:44:25,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76293e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:25, skipping insertion in model container [2018-11-28 23:44:25,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:44:25" (1/1) ... [2018-11-28 23:44:25,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:44:25,184 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:44:25,384 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:44:25,400 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:44:25,420 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:44:25,437 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:44:25,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:25 WrapperNode [2018-11-28 23:44:25,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:44:25,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:44:25,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:44:25,438 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:44:25,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:25" (1/1) ... [2018-11-28 23:44:25,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:25" (1/1) ... [2018-11-28 23:44:25,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:44:25,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:44:25,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:44:25,479 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:44:25,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:25" (1/1) ... [2018-11-28 23:44:25,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:25" (1/1) ... [2018-11-28 23:44:25,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:25" (1/1) ... [2018-11-28 23:44:25,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:25" (1/1) ... [2018-11-28 23:44:25,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:25" (1/1) ... [2018-11-28 23:44:25,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:25" (1/1) ... [2018-11-28 23:44:25,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:25" (1/1) ... [2018-11-28 23:44:25,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:44:25,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:44:25,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:44:25,507 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:44:25,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:25,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:44:25,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:44:25,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:44:25,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:44:25,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:44:25,928 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:44:25,928 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:44:25,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:44:25 BoogieIcfgContainer [2018-11-28 23:44:25,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:44:25,931 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:44:25,932 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:44:25,939 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:44:25,940 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:44:25,941 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:44:25" (1/3) ... [2018-11-28 23:44:25,943 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c35592f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:44:25, skipping insertion in model container [2018-11-28 23:44:25,943 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:44:25,943 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:25" (2/3) ... [2018-11-28 23:44:25,944 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c35592f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:44:25, skipping insertion in model container [2018-11-28 23:44:25,944 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:44:25,944 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:44:25" (3/3) ... [2018-11-28 23:44:25,948 INFO L375 chiAutomizerObserver]: Analyzing ICFG mcmillan2006_true-unreach-call_true-termination.c.i [2018-11-28 23:44:26,060 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:44:26,061 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:44:26,061 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:44:26,062 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:44:26,062 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:44:26,062 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:44:26,062 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:44:26,063 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:44:26,063 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:44:26,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 23:44:26,108 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 23:44:26,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:26,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:26,115 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:44:26,116 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:44:26,116 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:44:26,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 23:44:26,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 23:44:26,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:26,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:26,119 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:44:26,119 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:44:26,126 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 15#L14true assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 11#L16-3true [2018-11-28 23:44:26,126 INFO L796 eck$LassoCheckResult]: Loop: 11#L16-3true assume !!(main_~i~0 < main_~n~0);call write~int(0, main_~x~0.base, main_~x~0.offset + 4 * main_~i~0, 4); 16#L16-2true main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 11#L16-3true [2018-11-28 23:44:26,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:26,133 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 23:44:26,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:26,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:26,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:26,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:26,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:26,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:26,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2018-11-28 23:44:26,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:26,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:26,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:26,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:26,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:26,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:26,282 INFO L82 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2018-11-28 23:44:26,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:26,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:26,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:26,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:26,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:26,601 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 23:44:26,852 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 23:44:26,865 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:26,866 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:26,867 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:26,867 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:26,867 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:26,867 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:26,867 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:26,867 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:26,868 INFO L131 ssoRankerPreferences]: Filename of dumped script: mcmillan2006_true-unreach-call_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:44:26,868 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:26,868 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:26,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:26,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:26,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:26,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:26,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:27,065 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-11-28 23:44:27,193 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-28 23:44:27,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:27,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:27,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:27,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:27,358 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 23:44:27,761 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-28 23:44:27,872 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:27,876 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:27,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:27,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:27,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:27,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:27,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:27,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:27,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:27,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:27,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:27,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:27,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:27,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:27,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:27,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:27,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:27,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:27,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:27,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:27,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:27,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:27,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:27,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:27,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:27,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:27,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:27,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:27,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:27,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:27,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:27,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:27,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:27,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:27,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:44:27,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:44:27,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:27,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:27,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:27,914 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:44:27,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:27,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:27,918 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:44:27,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:44:27,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:27,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:27,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:27,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:27,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:27,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:27,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:27,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:27,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:27,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:27,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:27,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:27,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:27,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:27,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:27,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:44:27,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:44:28,064 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:28,190 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:44:28,195 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:44:28,198 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:28,202 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:44:28,203 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:28,204 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0.offset, v_rep(select #length ULTIMATE.start_main_~x~0.base)_1, ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~x~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~x~0.base)_1 - 4*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:44:28,266 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:44:28,274 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:44:28,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:28,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:28,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:28,471 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:44:28,472 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2018-11-28 23:44:28,572 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 40 states and 51 transitions. Complement of second has 7 states. [2018-11-28 23:44:28,573 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 [2018-11-28 23:44:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:44:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-28 23:44:28,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 23:44:28,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:28,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:44:28,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:28,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-28 23:44:28,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:28,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2018-11-28 23:44:28,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:44:28,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 11 states and 13 transitions. [2018-11-28 23:44:28,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 23:44:28,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:44:28,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2018-11-28 23:44:28,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:44:28,594 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-28 23:44:28,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2018-11-28 23:44:28,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-28 23:44:28,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:44:28,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-11-28 23:44:28,621 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-28 23:44:28,621 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-28 23:44:28,622 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:44:28,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2018-11-28 23:44:28,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:44:28,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:28,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:28,624 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:44:28,624 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:44:28,624 INFO L794 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 111#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 112#L14 assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 117#L16-3 assume !(main_~i~0 < main_~n~0); 116#L16-4 main_~i~1 := 0; 110#L17-3 [2018-11-28 23:44:28,626 INFO L796 eck$LassoCheckResult]: Loop: 110#L17-3 assume !!(main_~i~1 < main_~n~0);call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset + 4 * main_~i~1, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 113#L5 assume !(0 == __VERIFIER_assert_~cond); 114#L5-2 havoc main_#t~mem5; 109#L17-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 110#L17-3 [2018-11-28 23:44:28,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:28,626 INFO L82 PathProgramCache]: Analyzing trace with hash 28695884, now seen corresponding path program 1 times [2018-11-28 23:44:28,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:28,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:28,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:28,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:28,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:28,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:28,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1823306, now seen corresponding path program 1 times [2018-11-28 23:44:28,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:28,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:28,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:28,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:28,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:28,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:28,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1304171029, now seen corresponding path program 1 times [2018-11-28 23:44:28,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:28,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:28,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:28,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:28,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:28,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:28,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:44:28,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:44:28,969 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2018-11-28 23:44:28,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:44:28,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:44:28,976 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-28 23:44:29,120 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-28 23:44:29,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:44:29,163 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-28 23:44:29,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:44:29,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2018-11-28 23:44:29,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:44:29,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 13 transitions. [2018-11-28 23:44:29,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:44:29,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:44:29,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2018-11-28 23:44:29,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:44:29,170 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-28 23:44:29,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2018-11-28 23:44:29,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-11-28 23:44:29,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:44:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-11-28 23:44:29,172 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-28 23:44:29,172 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-28 23:44:29,173 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:44:29,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2018-11-28 23:44:29,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:44:29,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:29,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:29,175 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:29,175 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:44:29,176 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 147#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 148#L14 assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 153#L16-3 assume !!(main_~i~0 < main_~n~0);call write~int(0, main_~x~0.base, main_~x~0.offset + 4 * main_~i~0, 4); 154#L16-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 155#L16-3 assume !(main_~i~0 < main_~n~0); 152#L16-4 main_~i~1 := 0; 146#L17-3 [2018-11-28 23:44:29,177 INFO L796 eck$LassoCheckResult]: Loop: 146#L17-3 assume !!(main_~i~1 < main_~n~0);call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset + 4 * main_~i~1, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 149#L5 assume !(0 == __VERIFIER_assert_~cond); 150#L5-2 havoc main_#t~mem5; 145#L17-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 146#L17-3 [2018-11-28 23:44:29,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:29,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1806996910, now seen corresponding path program 1 times [2018-11-28 23:44:29,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:29,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:29,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:29,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:29,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:29,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:29,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1823306, now seen corresponding path program 2 times [2018-11-28 23:44:29,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:29,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:29,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:29,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:29,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:29,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:29,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1358706313, now seen corresponding path program 1 times [2018-11-28 23:44:29,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:29,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:29,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:29,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:29,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:29,415 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2018-11-28 23:44:29,587 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2018-11-28 23:44:29,652 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:29,652 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:29,652 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:29,652 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:29,652 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:29,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:29,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:29,653 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:29,653 INFO L131 ssoRankerPreferences]: Filename of dumped script: mcmillan2006_true-unreach-call_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:44:29,654 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:29,654 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:29,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:29,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:29,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:29,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:29,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:29,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:29,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:29,868 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2018-11-28 23:44:29,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:29,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:30,229 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:30,230 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:30,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:30,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:30,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:30,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:30,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:30,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:30,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:30,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:30,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:30,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:30,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:30,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:30,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:30,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:30,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:30,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:30,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:30,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:30,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:30,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:30,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:30,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:30,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:30,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:30,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:30,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:30,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:30,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:30,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:30,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:30,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:30,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:30,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:44:30,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:44:30,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:30,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:30,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:30,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:30,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:30,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:30,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:30,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:30,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:30,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:30,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:30,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:30,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:30,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:30,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:30,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:30,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:30,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:30,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:30,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:30,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:30,275 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:44:30,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:30,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:30,278 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:44:30,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:44:30,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:30,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:30,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:30,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:30,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:30,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:30,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:44:30,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:44:30,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:30,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:30,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:30,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:30,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:30,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:30,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:44:30,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:44:30,336 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:30,400 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-28 23:44:30,400 INFO L444 ModelExtractionUtils]: 14 out of 25 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-28 23:44:30,401 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:30,406 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:44:30,406 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:30,406 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0.offset, v_rep(select #length ULTIMATE.start_main_~x~0.base)_2, ULTIMATE.start_main_~i~1) = -1*ULTIMATE.start_main_~x~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~x~0.base)_2 - 4*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-11-28 23:44:30,455 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:44:30,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:44:30,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:30,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:30,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:30,689 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:44:30,689 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-11-28 23:44:30,713 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 15 states and 17 transitions. Complement of second has 4 states. [2018-11-28 23:44:30,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:30,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:44:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-28 23:44:30,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-28 23:44:30,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:30,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-28 23:44:30,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:30,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 8 letters. [2018-11-28 23:44:30,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:30,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-11-28 23:44:30,717 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:44:30,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2018-11-28 23:44:30,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:44:30,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:44:30,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:44:30,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:44:30,718 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:44:30,718 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:44:30,718 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:44:30,718 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:44:30,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:44:30,718 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:44:30,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:44:30,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:44:30 BoogieIcfgContainer [2018-11-28 23:44:30,726 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:44:30,727 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:44:30,727 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:44:30,727 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:44:30,728 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:44:25" (3/4) ... [2018-11-28 23:44:30,732 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:44:30,732 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:44:30,733 INFO L168 Benchmark]: Toolchain (without parser) took 5590.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 952.7 MB in the beginning and 832.4 MB in the end (delta: 120.3 MB). Peak memory consumption was 252.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:44:30,735 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:44:30,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.53 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:44:30,737 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.11 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:44:30,739 INFO L168 Benchmark]: Boogie Preprocessor took 28.25 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:44:30,741 INFO L168 Benchmark]: RCFGBuilder took 422.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:44:30,742 INFO L168 Benchmark]: BuchiAutomizer took 4795.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 832.4 MB in the end (delta: 270.0 MB). Peak memory consumption was 270.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:44:30,743 INFO L168 Benchmark]: Witness Printer took 5.58 ms. Allocated memory is still 1.2 GB. Free memory is still 832.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:44:30,749 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 292.53 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.11 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.25 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 422.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4795.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 832.4 MB in the end (delta: 270.0 MB). Peak memory consumption was 270.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.58 ms. Allocated memory is still 1.2 GB. Free memory is still 832.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x + unknown-#length-unknown[x] + -4 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * x + unknown-#length-unknown[x] + -4 * i and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 32 SDtfs, 30 SDslu, 30 SDs, 0 SdLazy, 26 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital110 mio100 ax100 hnf99 lsp91 ukn84 mio100 lsp65 div100 bol100 ite100 ukn100 eq165 hnf90 smp92 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...