./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c -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 1b5ce1e17bce3e34a2c882b1080bdbc1a62cb801 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:32:25,976 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:32:25,981 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:32:25,997 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:32:25,998 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:32:26,000 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:32:26,003 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:32:26,006 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:32:26,009 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:32:26,011 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:32:26,013 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:32:26,014 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:32:26,015 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:32:26,018 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:32:26,025 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:32:26,027 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:32:26,029 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:32:26,033 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:32:26,036 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:32:26,039 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:32:26,042 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:32:26,045 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:32:26,050 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:32:26,051 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:32:26,051 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:32:26,052 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:32:26,053 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:32:26,055 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:32:26,056 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:32:26,060 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:32:26,060 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:32:26,061 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:32:26,061 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:32:26,061 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:32:26,064 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:32:26,066 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:32:26,067 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:32:26,095 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:32:26,096 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:32:26,097 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:32:26,101 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:32:26,101 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:32:26,101 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:32:26,102 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:32:26,102 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:32:26,102 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:32:26,102 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:32:26,102 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:32:26,102 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:32:26,103 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:32:26,103 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:32:26,103 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:32:26,103 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:32:26,103 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:32:26,103 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:32:26,104 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:32:26,106 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:32:26,106 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:32:26,106 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:32:26,107 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:32:26,107 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:32:26,107 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:32:26,107 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:32:26,107 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:32:26,107 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:32:26,108 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:32:26,108 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 -> 1b5ce1e17bce3e34a2c882b1080bdbc1a62cb801 [2019-01-01 21:32:26,159 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:32:26,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:32:26,179 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:32:26,181 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:32:26,181 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:32:26,182 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 21:32:26,239 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c615bff02/22a228cb134a4e47ba547353db4efe30/FLAGd96cad6d6 [2019-01-01 21:32:26,659 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:32:26,659 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 21:32:26,666 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c615bff02/22a228cb134a4e47ba547353db4efe30/FLAGd96cad6d6 [2019-01-01 21:32:27,028 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c615bff02/22a228cb134a4e47ba547353db4efe30 [2019-01-01 21:32:27,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:32:27,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:32:27,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:32:27,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:32:27,038 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:32:27,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be24df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27, skipping insertion in model container [2019-01-01 21:32:27,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:32:27,066 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:32:27,292 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:32:27,298 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:32:27,315 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:32:27,333 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:32:27,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27 WrapperNode [2019-01-01 21:32:27,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:32:27,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:32:27,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:32:27,335 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:32:27,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,349 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:32:27,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:32:27,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:32:27,367 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:32:27,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:32:27,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:32:27,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:32:27,381 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:32:27,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:27,492 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-01-01 21:32:27,492 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-01-01 21:32:27,492 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-01-01 21:32:27,493 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-01-01 21:32:27,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:32:27,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:32:27,705 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:32:27,706 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 21:32:27,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:32:27 BoogieIcfgContainer [2019-01-01 21:32:27,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:32:27,707 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:32:27,707 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:32:27,712 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:32:27,713 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:32:27,713 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:32:27" (1/3) ... [2019-01-01 21:32:27,715 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@729f0860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:32:27, skipping insertion in model container [2019-01-01 21:32:27,715 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:32:27,715 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (2/3) ... [2019-01-01 21:32:27,716 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@729f0860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:32:27, skipping insertion in model container [2019-01-01 21:32:27,716 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:32:27,716 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:32:27" (3/3) ... [2019-01-01 21:32:27,720 INFO L375 chiAutomizerObserver]: Analyzing ICFG NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 21:32:27,812 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:32:27,817 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:32:27,817 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:32:27,817 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:32:27,817 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:32:27,817 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:32:27,817 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:32:27,817 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:32:27,818 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:32:27,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-01 21:32:27,877 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 21:32:27,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:27,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:27,887 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:32:27,887 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:32:27,887 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:32:27,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-01 21:32:27,890 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 21:32:27,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:27,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:27,891 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:32:27,891 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:32:27,900 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 22#L25true call main_#t~ret6 := rec2(main_~x~0);< 3#rec2ENTRYtrue [2019-01-01 21:32:27,900 INFO L796 eck$LassoCheckResult]: Loop: 3#rec2ENTRYtrue ~j := #in~j; 20#L18true assume !(~j <= 0); 18#L20true call #t~ret3 := rec2(~j - 1);< 3#rec2ENTRYtrue [2019-01-01 21:32:27,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:27,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1617, now seen corresponding path program 1 times [2019-01-01 21:32:27,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:27,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:27,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:27,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:27,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:27,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:27,992 INFO L82 PathProgramCache]: Analyzing trace with hash 39867, now seen corresponding path program 1 times [2019-01-01 21:32:27,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:27,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:27,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:27,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:27,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:28,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:28,012 INFO L82 PathProgramCache]: Analyzing trace with hash 48182123, now seen corresponding path program 1 times [2019-01-01 21:32:28,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:28,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:28,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:28,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:28,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:28,183 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:28,185 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:28,185 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:28,185 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:28,185 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:28,186 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:28,186 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:28,186 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:28,186 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2019-01-01 21:32:28,186 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:28,187 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:28,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:28,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:28,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:28,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:28,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:28,381 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:28,382 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:28,394 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:28,394 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:28,404 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:28,405 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#res=0} Honda state: {rec2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:28,428 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:28,428 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:28,431 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:28,431 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret3=0} Honda state: {rec2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:28,452 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:28,453 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:28,457 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:28,457 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret4=0} Honda state: {rec2_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:28,479 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:28,479 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:28,504 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:28,504 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:28,534 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:28,536 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:28,536 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:28,536 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:28,536 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:28,537 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:28,537 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:28,537 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:28,537 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:28,537 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2019-01-01 21:32:28,538 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:28,538 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:28,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:28,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:28,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:28,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:28,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:28,861 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:28,867 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:28,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:28,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:28,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:28,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:28,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:28,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:28,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:28,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:28,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:28,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:28,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:28,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:28,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:28,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:28,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:28,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:28,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:28,889 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:28,895 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:28,895 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:32:28,899 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:28,900 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:28,900 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:28,901 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#in~j) = 1*rec2_#in~j Supporting invariants [] [2019-01-01 21:32:28,902 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:28,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:28,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:29,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:29,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:29,373 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:32:29,375 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 4 states. [2019-01-01 21:32:29,728 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 4 states. Result 36 states and 44 transitions. Complement of second has 12 states. [2019-01-01 21:32:29,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:32:29,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-01-01 21:32:29,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 3 letters. [2019-01-01 21:32:29,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:29,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-01 21:32:29,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:29,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-01 21:32:29,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:29,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2019-01-01 21:32:29,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:32:29,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 23 states and 30 transitions. [2019-01-01 21:32:29,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-01 21:32:29,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-01 21:32:29,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2019-01-01 21:32:29,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:29,755 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-01 21:32:29,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2019-01-01 21:32:29,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-01-01 21:32:29,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 21:32:29,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-01-01 21:32:29,787 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-01 21:32:29,787 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-01 21:32:29,787 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:32:29,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-01-01 21:32:29,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:32:29,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:29,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:29,790 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:29,790 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:32:29,791 INFO L794 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 108#L25 call main_#t~ret6 := rec2(main_~x~0);< 107#rec2ENTRY ~j := #in~j; 109#L18 assume !(~j <= 0); 111#L20 call #t~ret3 := rec2(~j - 1);< 110#rec2ENTRY ~j := #in~j; 112#L18 assume ~j <= 0;#res := 0; 121#rec2FINAL assume true; 122#rec2EXIT >#33#return; 117#L20-1 call #t~ret4 := rec1(#t~ret3);< 113#rec1ENTRY [2019-01-01 21:32:29,791 INFO L796 eck$LassoCheckResult]: Loop: 113#rec1ENTRY ~i := #in~i; 118#L12 assume !(~i <= 0); 114#L14 call #t~ret0 := rec1(~i - 2);< 113#rec1ENTRY [2019-01-01 21:32:29,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:29,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1361947899, now seen corresponding path program 1 times [2019-01-01 21:32:29,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:29,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:29,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:29,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:29,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:29,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:29,809 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 1 times [2019-01-01 21:32:29,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:29,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:29,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:29,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:29,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:29,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:29,817 INFO L82 PathProgramCache]: Analyzing trace with hash 766186353, now seen corresponding path program 1 times [2019-01-01 21:32:29,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:29,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:29,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:29,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:29,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:29,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:32:29,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:32:29,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 21:32:30,009 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:30,009 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:30,009 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:30,009 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:30,010 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:30,010 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:30,010 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:30,010 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:30,011 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-01 21:32:30,011 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:30,011 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:30,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,519 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:30,519 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:30,524 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:30,524 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:30,550 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:30,550 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:30,573 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:30,577 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:30,577 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:30,577 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:30,577 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:30,577 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:30,577 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:30,578 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:30,578 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:30,578 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-01 21:32:30,578 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:30,578 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:30,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,712 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:30,712 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:30,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:30,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:30,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:30,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:30,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:30,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:30,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:30,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:30,722 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:30,725 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-01 21:32:30,726 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:32:30,726 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:30,726 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:30,726 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:30,727 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-01-01 21:32:30,727 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:30,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:30,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:30,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:30,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:30,953 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 21:32:30,953 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 5 states. [2019-01-01 21:32:31,135 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 43 states and 58 transitions. Complement of second has 14 states. [2019-01-01 21:32:31,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:31,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-01-01 21:32:31,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-01 21:32:31,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:31,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 13 letters. Loop has 3 letters. [2019-01-01 21:32:31,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:31,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 21:32:31,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:31,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 58 transitions. [2019-01-01 21:32:31,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:32:31,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 37 states and 50 transitions. [2019-01-01 21:32:31,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:32:31,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-01 21:32:31,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2019-01-01 21:32:31,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:31,149 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2019-01-01 21:32:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2019-01-01 21:32:31,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-01-01 21:32:31,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-01 21:32:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2019-01-01 21:32:31,156 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-01-01 21:32:31,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 21:32:31,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:32:31,161 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 6 states. [2019-01-01 21:32:31,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:32:31,262 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-01-01 21:32:31,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 21:32:31,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2019-01-01 21:32:31,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:32:31,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 40 transitions. [2019-01-01 21:32:31,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-01 21:32:31,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-01 21:32:31,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2019-01-01 21:32:31,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:31,268 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-01-01 21:32:31,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2019-01-01 21:32:31,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-01-01 21:32:31,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 21:32:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-01-01 21:32:31,274 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-01-01 21:32:31,274 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-01-01 21:32:31,274 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:32:31,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2019-01-01 21:32:31,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:32:31,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:31,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:31,276 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:31,277 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:32:31,277 INFO L794 eck$LassoCheckResult]: Stem: 343#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 320#L25 call main_#t~ret6 := rec2(main_~x~0);< 319#rec2ENTRY ~j := #in~j; 321#L18 assume !(~j <= 0); 323#L20 call #t~ret3 := rec2(~j - 1);< 322#rec2ENTRY ~j := #in~j; 325#L18 assume !(~j <= 0); 324#L20 call #t~ret3 := rec2(~j - 1);< 322#rec2ENTRY ~j := #in~j; 326#L18 assume ~j <= 0;#res := 0; 336#rec2FINAL assume true; 337#rec2EXIT >#33#return; 328#L20-1 call #t~ret4 := rec1(#t~ret3);< 327#rec1ENTRY ~i := #in~i; 329#L12 assume ~i <= 0;#res := 0; 340#rec1FINAL assume true; 341#rec1EXIT >#35#return; 342#L20-2 #res := #t~ret4 - 1;havoc #t~ret3;havoc #t~ret4; 344#rec2FINAL assume true; 346#rec2EXIT >#33#return; 332#L20-1 call #t~ret4 := rec1(#t~ret3);< 338#rec1ENTRY [2019-01-01 21:32:31,277 INFO L796 eck$LassoCheckResult]: Loop: 338#rec1ENTRY ~i := #in~i; 345#L12 assume !(~i <= 0); 334#L14 call #t~ret0 := rec1(~i - 2);< 338#rec1ENTRY [2019-01-01 21:32:31,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:31,278 INFO L82 PathProgramCache]: Analyzing trace with hash -196165858, now seen corresponding path program 1 times [2019-01-01 21:32:31,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:31,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:31,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:31,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:31,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:31,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:31,310 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 2 times [2019-01-01 21:32:31,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:31,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:31,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:31,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:31,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:31,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:31,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1473414328, now seen corresponding path program 1 times [2019-01-01 21:32:31,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:31,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:31,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:31,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:31,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:31,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-01 21:32:31,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:32:31,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 21:32:31,553 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:31,553 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:31,553 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:31,553 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:31,554 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:31,554 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:31,554 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:31,554 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:31,554 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-01 21:32:31,555 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:31,555 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:31,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:31,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:31,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:31,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:31,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:31,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:31,628 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:31,628 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:31,633 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:31,633 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:31,637 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:31,637 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:31,659 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:31,659 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:31,662 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:31,662 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:31,683 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:31,683 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:31,696 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:31,696 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:31,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:31,716 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:31,719 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:31,719 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:31,740 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:31,740 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:31,743 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:31,743 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:31,769 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:31,769 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:31,792 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:31,792 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:31,819 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:31,820 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:31,820 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:31,821 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:31,821 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:31,821 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:31,821 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:31,821 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:31,821 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:31,821 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-01 21:32:31,822 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:31,822 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:31,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:31,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:31,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:31,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:31,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:31,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:31,885 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:31,885 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:31,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:31,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:31,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:31,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:31,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:31,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:31,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:31,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:31,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:31,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:31,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:31,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:31,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:31,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:31,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:31,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:31,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:31,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:31,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:31,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:31,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:31,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:31,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:31,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:31,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:31,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:31,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:31,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:31,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:31,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:31,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:31,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:31,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:31,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:31,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:31,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:31,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:31,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:31,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:31,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:31,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:31,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:31,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:31,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:31,903 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:31,905 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-01 21:32:31,906 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:32:31,906 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:31,906 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:31,906 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:31,906 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-01-01 21:32:31,907 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:31,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:31,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:32,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:32,070 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 21:32:32,070 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-01-01 21:32:32,164 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 31 states and 37 transitions. Complement of second has 7 states. [2019-01-01 21:32:32,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:32,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:32,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-01 21:32:32,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 21 letters. Loop has 3 letters. [2019-01-01 21:32:32,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:32,170 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:32,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:32,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:32,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:32,350 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 21:32:32,350 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-01-01 21:32:32,430 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 31 states and 37 transitions. Complement of second has 7 states. [2019-01-01 21:32:32,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:32,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-01 21:32:32,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 21 letters. Loop has 3 letters. [2019-01-01 21:32:32,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:32,433 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:32,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:32,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:32,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:32,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:32,686 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 21:32:32,686 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-01-01 21:32:32,800 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 53 states and 65 transitions. Complement of second has 13 states. [2019-01-01 21:32:32,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:32,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:32,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2019-01-01 21:32:32,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 21 letters. Loop has 3 letters. [2019-01-01 21:32:32,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:32,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 24 letters. Loop has 3 letters. [2019-01-01 21:32:32,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:32,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 21 letters. Loop has 6 letters. [2019-01-01 21:32:32,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:32,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2019-01-01 21:32:32,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:32:32,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 41 states and 52 transitions. [2019-01-01 21:32:32,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-01 21:32:32,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-01-01 21:32:32,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2019-01-01 21:32:32,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:32,810 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2019-01-01 21:32:32,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2019-01-01 21:32:32,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-01-01 21:32:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 21:32:32,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2019-01-01 21:32:32,816 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2019-01-01 21:32:32,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 21:32:32,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-01 21:32:32,817 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 8 states. [2019-01-01 21:32:32,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:32:32,899 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-01-01 21:32:32,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 21:32:32,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 29 transitions. [2019-01-01 21:32:32,902 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:32:32,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2019-01-01 21:32:32,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:32:32,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:32:32,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:32:32,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:32:32,902 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:32,903 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:32,903 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:32,903 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:32:32,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:32:32,903 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:32:32,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:32:32,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:32:32 BoogieIcfgContainer [2019-01-01 21:32:32,910 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:32:32,910 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:32:32,910 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:32:32,910 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:32:32,911 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:32:27" (3/4) ... [2019-01-01 21:32:32,915 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:32:32,915 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:32:32,916 INFO L168 Benchmark]: Toolchain (without parser) took 5883.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -199.8 MB). Peak memory consumption was 1.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:32,918 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:32,918 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.11 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:32,919 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.02 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:32,919 INFO L168 Benchmark]: Boogie Preprocessor took 14.52 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:32,920 INFO L168 Benchmark]: RCFGBuilder took 325.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:32,921 INFO L168 Benchmark]: BuchiAutomizer took 5202.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -47.3 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:32,922 INFO L168 Benchmark]: Witness Printer took 4.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:32,926 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 300.11 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 31.02 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.52 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 325.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5202.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -47.3 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function \old(j) and consists of 4 locations. One deterministic module has affine ranking function \old(i) and consists of 5 locations. One nondeterministic module has affine ranking function \old(i) and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 4 iterations. TraceHistogramMax:3. Analysis of lassos took 2.6s. Construction of modules took 0.3s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 88 SDtfs, 94 SDslu, 174 SDs, 0 SdLazy, 125 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...