./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1b_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_1b_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 cb528549fa76ae8087cf7043645dfa20323a0116 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:19,263 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:32:19,265 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:32:19,277 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:32:19,278 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:32:19,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:32:19,281 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:32:19,283 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:32:19,285 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:32:19,286 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:32:19,287 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:32:19,287 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:32:19,288 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:32:19,289 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:32:19,291 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:32:19,292 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:32:19,293 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:32:19,295 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:32:19,297 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:32:19,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:32:19,300 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:32:19,301 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:32:19,304 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:32:19,304 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:32:19,305 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:32:19,306 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:32:19,307 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:32:19,308 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:32:19,309 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:32:19,310 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:32:19,310 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:32:19,311 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:32:19,312 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:32:19,312 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:32:19,313 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:32:19,314 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:32:19,314 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:19,332 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:32:19,332 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:32:19,333 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:32:19,333 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:32:19,333 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:32:19,334 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:32:19,334 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:32:19,334 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:32:19,335 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:32:19,335 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:32:19,335 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:32:19,335 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:32:19,335 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:32:19,336 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:32:19,337 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:32:19,337 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:32:19,337 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:32:19,337 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:32:19,337 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:32:19,337 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:32:19,337 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:32:19,338 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:32:19,338 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:32:19,338 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:32:19,338 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:32:19,338 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:32:19,340 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:32:19,340 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:32:19,341 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:32:19,342 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 -> cb528549fa76ae8087cf7043645dfa20323a0116 [2019-01-01 21:32:19,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:32:19,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:32:19,395 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:32:19,397 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:32:19,397 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:32:19,398 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 21:32:19,462 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14682298c/ac12bc9547ac480aa594b87cfaf89a7b/FLAG768a48392 [2019-01-01 21:32:19,917 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:32:19,917 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 21:32:19,924 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14682298c/ac12bc9547ac480aa594b87cfaf89a7b/FLAG768a48392 [2019-01-01 21:32:20,276 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14682298c/ac12bc9547ac480aa594b87cfaf89a7b [2019-01-01 21:32:20,281 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:32:20,283 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:32:20,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:32:20,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:32:20,289 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:32:20,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:32:20" (1/1) ... [2019-01-01 21:32:20,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f54813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:20, skipping insertion in model container [2019-01-01 21:32:20,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:32:20" (1/1) ... [2019-01-01 21:32:20,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:32:20,321 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:32:20,550 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:32:20,555 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:32:20,577 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:32:20,597 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:32:20,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:20 WrapperNode [2019-01-01 21:32:20,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:32:20,599 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:32:20,599 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:32:20,599 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:32:20,611 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:20" (1/1) ... [2019-01-01 21:32:20,617 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:20" (1/1) ... [2019-01-01 21:32:20,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:32:20,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:32:20,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:32:20,642 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:32:20,653 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:20" (1/1) ... [2019-01-01 21:32:20,653 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:20" (1/1) ... [2019-01-01 21:32:20,654 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:20" (1/1) ... [2019-01-01 21:32:20,655 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:20" (1/1) ... [2019-01-01 21:32:20,661 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:20" (1/1) ... [2019-01-01 21:32:20,664 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:20" (1/1) ... [2019-01-01 21:32:20,665 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:20" (1/1) ... [2019-01-01 21:32:20,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:32:20,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:32:20,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:32:20,668 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:32:20,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:20" (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:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-01-01 21:32:20,855 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-01-01 21:32:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-01-01 21:32:20,856 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-01-01 21:32:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:32:20,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:32:21,132 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:32:21,133 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 21:32:21,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:32:21 BoogieIcfgContainer [2019-01-01 21:32:21,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:32:21,135 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:32:21,135 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:32:21,141 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:32:21,142 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:32:21,142 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:32:20" (1/3) ... [2019-01-01 21:32:21,144 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fe400c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:32:21, skipping insertion in model container [2019-01-01 21:32:21,144 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:32:21,144 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:20" (2/3) ... [2019-01-01 21:32:21,145 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fe400c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:32:21, skipping insertion in model container [2019-01-01 21:32:21,145 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:32:21,145 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:32:21" (3/3) ... [2019-01-01 21:32:21,148 INFO L375 chiAutomizerObserver]: Analyzing ICFG NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 21:32:21,223 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:32:21,224 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:32:21,224 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:32:21,225 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:32:21,225 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:32:21,225 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:32:21,225 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:32:21,225 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:32:21,225 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:32:21,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-01 21:32:21,308 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 21:32:21,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:21,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:21,317 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:32:21,317 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:21,317 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:32:21,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-01 21:32:21,321 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 21:32:21,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:21,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:21,322 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:32:21,323 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:21,331 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:21,331 INFO L796 eck$LassoCheckResult]: Loop: 3#rec2ENTRYtrue ~j := #in~j; 20#L18true assume !(~j <= 0); 18#L20true call #t~ret3 := rec1(~j - 1);< 4#rec1ENTRYtrue ~i := #in~i; 9#L12true assume ~i <= 0;#res := 0; 5#rec1FINALtrue assume true; 12#rec1EXITtrue >#33#return; 23#L20-1true call #t~ret4 := rec2(#t~ret3);< 3#rec2ENTRYtrue [2019-01-01 21:32:21,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:21,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1617, now seen corresponding path program 1 times [2019-01-01 21:32:21,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:21,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:21,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:21,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:21,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:21,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:21,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1102838740, now seen corresponding path program 1 times [2019-01-01 21:32:21,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:21,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:21,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:21,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:21,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:21,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:21,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1371489668, now seen corresponding path program 1 times [2019-01-01 21:32:21,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:21,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:21,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:21,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:21,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:21,840 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:21,841 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:21,841 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:21,841 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:21,841 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:21,842 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:21,842 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:21,842 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:21,842 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2019-01-01 21:32:21,842 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:21,844 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:21,867 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:21,899 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:21,916 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:21,941 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:21,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:22,217 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:22,218 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:22,223 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:22,223 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:22,234 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:22,235 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_~j=0} Honda state: {rec2_~j=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:22,257 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:22,257 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:22,267 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:22,267 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:22,298 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:22,299 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:22,302 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:22,302 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 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:22,322 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:22,323 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:22,327 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:22,327 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 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:22,349 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:22,350 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:22,380 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:22,381 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:22,396 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:22,415 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:22,416 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:22,416 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:22,416 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:22,416 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:22,416 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:22,416 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:22,416 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:22,417 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2019-01-01 21:32:22,417 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:22,417 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:22,419 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:22,424 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:22,431 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:22,449 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:22,461 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:22,657 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:22,661 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:22,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:22,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:22,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:22,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:22,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:22,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:22,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:22,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:22,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:22,674 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:22,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:22,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:22,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:22,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:22,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:22,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:22,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:22,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:22,680 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:22,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:22,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:22,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:22,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:22,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:22,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:22,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:22,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:22,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:22,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:22,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:22,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:22,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:22,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:22,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:22,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:22,696 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:22,702 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:22,702 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:32:22,705 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:22,705 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:22,706 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:22,706 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#in~j) = 1*rec2_#in~j Supporting invariants [] [2019-01-01 21:32:22,708 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:22,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:22,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:22,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:23,246 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:23,261 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-01-01 21:32:23,262 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 7 states. [2019-01-01 21:32:24,613 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 7 states. Result 194 states and 279 transitions. Complement of second has 61 states. [2019-01-01 21:32:24,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:32:24,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 57 transitions. [2019-01-01 21:32:24,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 57 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-01 21:32:24,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:24,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 57 transitions. Stem has 10 letters. Loop has 8 letters. [2019-01-01 21:32:24,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:24,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 57 transitions. Stem has 2 letters. Loop has 16 letters. [2019-01-01 21:32:24,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:24,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 279 transitions. [2019-01-01 21:32:24,652 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 21:32:24,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 82 states and 120 transitions. [2019-01-01 21:32:24,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-01-01 21:32:24,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-01-01 21:32:24,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 120 transitions. [2019-01-01 21:32:24,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:24,668 INFO L705 BuchiCegarLoop]: Abstraction has 82 states and 120 transitions. [2019-01-01 21:32:24,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 120 transitions. [2019-01-01 21:32:24,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 55. [2019-01-01 21:32:24,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-01 21:32:24,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2019-01-01 21:32:24,710 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 83 transitions. [2019-01-01 21:32:24,710 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 83 transitions. [2019-01-01 21:32:24,710 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:32:24,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 83 transitions. [2019-01-01 21:32:24,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 21:32:24,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:24,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:24,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:24,713 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:32:24,714 INFO L794 eck$LassoCheckResult]: Stem: 378#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; 345#L25 call main_#t~ret6 := rec2(main_~x~0);< 344#rec2ENTRY ~j := #in~j; 347#L18 assume !(~j <= 0); 363#L20 call #t~ret3 := rec1(~j - 1);< 379#rec1ENTRY ~i := #in~i; 397#L12 assume !(~i <= 0); 351#L14 call #t~ret0 := rec1(~i - 2);< 350#rec1ENTRY [2019-01-01 21:32:24,714 INFO L796 eck$LassoCheckResult]: Loop: 350#rec1ENTRY ~i := #in~i; 358#L12 assume !(~i <= 0); 354#L14 call #t~ret0 := rec1(~i - 2);< 350#rec1ENTRY [2019-01-01 21:32:24,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:24,714 INFO L82 PathProgramCache]: Analyzing trace with hash 874549579, now seen corresponding path program 1 times [2019-01-01 21:32:24,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:24,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:24,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:24,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:24,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:24,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:24,738 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 1 times [2019-01-01 21:32:24,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:24,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:24,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:24,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:24,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:24,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:24,745 INFO L82 PathProgramCache]: Analyzing trace with hash 434890603, now seen corresponding path program 2 times [2019-01-01 21:32:24,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:24,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:24,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:24,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:24,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:24,880 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:24,880 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:24,880 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:24,880 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:24,880 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:24,881 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:24,881 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:24,881 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:24,881 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-01 21:32:24,881 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:24,881 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:24,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:24,897 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:24,898 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:24,902 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:24,907 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:24,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:25,005 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:25,005 INFO L412 LassoAnalysis]: Checking for nontermination... 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:25,011 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:25,011 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:25,014 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:25,014 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 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:25,036 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:25,036 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:25,039 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:25,039 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 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:25,061 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:25,061 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:25,071 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:25,071 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 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:25,094 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:25,094 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:25,097 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:25,098 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 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:25,119 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:25,119 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:25,122 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:25,123 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 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:25,144 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:25,145 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:25,171 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:25,171 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:25,193 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:25,195 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:25,195 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:25,195 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:25,195 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:25,196 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:25,196 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:25,196 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:25,196 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:25,196 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-01 21:32:25,196 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:25,196 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:25,198 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:25,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:25,222 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:25,225 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:25,230 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:25,242 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:25,279 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:25,279 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:25,280 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:25,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:25,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:25,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:25,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:25,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:25,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:25,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:25,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:25,286 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:25,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:25,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:25,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:25,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:25,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:25,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:25,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:25,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:25,290 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:25,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:25,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:25,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:25,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:25,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:25,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:25,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:25,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:25,293 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:25,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:25,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:25,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:25,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:25,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:25,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:25,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:25,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:25,297 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:25,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:25,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:25,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:25,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:25,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:25,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:25,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:25,304 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:25,307 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-01 21:32:25,307 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:32:25,307 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:25,308 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:25,308 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:25,311 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-01-01 21:32:25,311 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:25,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:25,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:25,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:25,438 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:25,439 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:25,439 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 83 transitions. cyclomatic complexity: 32 Second operand 4 states. [2019-01-01 21:32:25,516 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 83 transitions. cyclomatic complexity: 32. Second operand 4 states. Result 105 states and 149 transitions. Complement of second has 13 states. [2019-01-01 21:32:25,518 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:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:32:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-01-01 21:32:25,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-01 21:32:25,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:25,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-01 21:32:25,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:25,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-01 21:32:25,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:25,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 149 transitions. [2019-01-01 21:32:25,526 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 21:32:25,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 93 states and 137 transitions. [2019-01-01 21:32:25,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-01-01 21:32:25,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-01-01 21:32:25,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 137 transitions. [2019-01-01 21:32:25,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:25,535 INFO L705 BuchiCegarLoop]: Abstraction has 93 states and 137 transitions. [2019-01-01 21:32:25,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 137 transitions. [2019-01-01 21:32:25,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2019-01-01 21:32:25,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-01 21:32:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2019-01-01 21:32:25,550 INFO L728 BuchiCegarLoop]: Abstraction has 89 states and 129 transitions. [2019-01-01 21:32:25,550 INFO L608 BuchiCegarLoop]: Abstraction has 89 states and 129 transitions. [2019-01-01 21:32:25,550 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:32:25,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 129 transitions. [2019-01-01 21:32:25,554 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 21:32:25,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:25,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:25,555 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:25,555 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:32:25,558 INFO L794 eck$LassoCheckResult]: Stem: 613#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; 614#L25 call main_#t~ret6 := rec2(main_~x~0);< 620#rec2ENTRY ~j := #in~j; 633#L18 assume !(~j <= 0); 615#L20 call #t~ret3 := rec1(~j - 1);< 642#rec1ENTRY ~i := #in~i; 637#L12 assume !(~i <= 0); 577#L14 call #t~ret0 := rec1(~i - 2);< 576#rec1ENTRY ~i := #in~i; 579#L12 assume ~i <= 0;#res := 0; 583#rec1FINAL assume true; 584#rec1EXIT >#27#return; 593#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 595#rec1ENTRY [2019-01-01 21:32:25,558 INFO L796 eck$LassoCheckResult]: Loop: 595#rec1ENTRY ~i := #in~i; 632#L12 assume !(~i <= 0); 589#L14 call #t~ret0 := rec1(~i - 2);< 595#rec1ENTRY [2019-01-01 21:32:25,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:25,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1317996508, now seen corresponding path program 1 times [2019-01-01 21:32:25,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:25,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:25,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:25,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:25,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:25,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:25,577 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 2 times [2019-01-01 21:32:25,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:25,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:25,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:25,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:25,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:25,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:25,584 INFO L82 PathProgramCache]: Analyzing trace with hash -157050054, now seen corresponding path program 2 times [2019-01-01 21:32:25,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:25,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:25,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:25,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:25,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:32:25,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:32:25,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 21:32:25,741 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:25,741 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:25,742 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:25,742 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:25,742 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:25,742 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:25,742 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:25,742 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:25,742 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-01 21:32:25,742 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:25,742 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:25,744 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:25,746 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:25,753 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:25,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:25,756 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:25,761 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:25,804 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:25,804 INFO L412 LassoAnalysis]: Checking for nontermination... 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:25,810 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:25,810 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:25,814 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:25,814 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 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:25,834 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:25,834 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:25,858 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:25,858 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:25,879 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:25,881 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:25,881 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:25,881 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:25,881 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:25,881 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:25,882 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:25,882 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:25,882 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:25,882 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-01 21:32:25,882 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:25,882 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:25,883 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:25,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:25,903 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:25,908 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:25,911 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:25,913 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:25,998 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:25,998 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:25,999 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:25,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:26,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:26,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:26,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:26,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:26,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:26,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:26,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:26,006 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:26,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:26,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:26,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:26,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:26,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:26,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:26,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:26,014 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:26,017 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-01 21:32:26,017 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:32:26,019 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:26,019 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:26,020 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:26,020 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-01-01 21:32:26,020 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:26,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:26,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:26,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:26,157 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:26,158 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:26,158 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 129 transitions. cyclomatic complexity: 47 Second operand 5 states. [2019-01-01 21:32:26,310 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 129 transitions. cyclomatic complexity: 47. Second operand 5 states. Result 134 states and 193 transitions. Complement of second has 14 states. [2019-01-01 21:32:26,313 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:26,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:26,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-01-01 21:32:26,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 3 letters. [2019-01-01 21:32:26,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:26,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 16 letters. Loop has 3 letters. [2019-01-01 21:32:26,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:26,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2019-01-01 21:32:26,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:26,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 193 transitions. [2019-01-01 21:32:26,319 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 21:32:26,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 122 states and 181 transitions. [2019-01-01 21:32:26,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2019-01-01 21:32:26,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2019-01-01 21:32:26,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 181 transitions. [2019-01-01 21:32:26,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:26,325 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 181 transitions. [2019-01-01 21:32:26,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 181 transitions. [2019-01-01 21:32:26,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 113. [2019-01-01 21:32:26,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-01 21:32:26,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2019-01-01 21:32:26,338 INFO L728 BuchiCegarLoop]: Abstraction has 113 states and 165 transitions. [2019-01-01 21:32:26,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 21:32:26,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:32:26,343 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand 6 states. [2019-01-01 21:32:26,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:32:26,423 INFO L93 Difference]: Finished difference Result 123 states and 175 transitions. [2019-01-01 21:32:26,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 21:32:26,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 175 transitions. [2019-01-01 21:32:26,428 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-01 21:32:26,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 121 states and 173 transitions. [2019-01-01 21:32:26,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2019-01-01 21:32:26,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2019-01-01 21:32:26,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 173 transitions. [2019-01-01 21:32:26,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:26,434 INFO L705 BuchiCegarLoop]: Abstraction has 121 states and 173 transitions. [2019-01-01 21:32:26,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 173 transitions. [2019-01-01 21:32:26,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2019-01-01 21:32:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-01 21:32:26,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2019-01-01 21:32:26,446 INFO L728 BuchiCegarLoop]: Abstraction has 101 states and 143 transitions. [2019-01-01 21:32:26,446 INFO L608 BuchiCegarLoop]: Abstraction has 101 states and 143 transitions. [2019-01-01 21:32:26,446 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:32:26,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 143 transitions. [2019-01-01 21:32:26,448 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 21:32:26,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:26,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:26,450 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:26,450 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:26,450 INFO L794 eck$LassoCheckResult]: Stem: 1162#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; 1163#L25 call main_#t~ret6 := rec2(main_~x~0);< 1170#rec2ENTRY ~j := #in~j; 1181#L18 assume !(~j <= 0); 1140#L20 call #t~ret3 := rec1(~j - 1);< 1180#rec1ENTRY ~i := #in~i; 1179#L12 assume !(~i <= 0); 1156#L14 call #t~ret0 := rec1(~i - 2);< 1176#rec1ENTRY ~i := #in~i; 1175#L12 assume !(~i <= 0); 1153#L14 call #t~ret0 := rec1(~i - 2);< 1174#rec1ENTRY ~i := #in~i; 1178#L12 assume ~i <= 0;#res := 0; 1220#rec1FINAL assume true; 1160#rec1EXIT >#27#return; 1129#L14-1 [2019-01-01 21:32:26,450 INFO L796 eck$LassoCheckResult]: Loop: 1129#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1128#rec1ENTRY ~i := #in~i; 1131#L12 assume ~i <= 0;#res := 0; 1136#rec1FINAL assume true; 1137#rec1EXIT >#29#return; 1148#L14-2 call #t~ret2 := rec1(#t~ret1);< 1157#rec1ENTRY ~i := #in~i; 1200#L12 assume !(~i <= 0); 1149#L14 call #t~ret0 := rec1(~i - 2);< 1157#rec1ENTRY ~i := #in~i; 1200#L12 assume ~i <= 0;#res := 0; 1201#rec1FINAL assume true; 1209#rec1EXIT >#27#return; 1129#L14-1 [2019-01-01 21:32:26,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:26,451 INFO L82 PathProgramCache]: Analyzing trace with hash -377207200, now seen corresponding path program 1 times [2019-01-01 21:32:26,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:26,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:26,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:26,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:26,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:26,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:26,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1306212703, now seen corresponding path program 1 times [2019-01-01 21:32:26,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:26,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:26,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:26,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:26,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:32:26,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:32:26,571 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:32:26,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:26,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:26,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 21:32:26,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2019-01-01 21:32:26,623 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:32:26,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 21:32:26,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:32:26,623 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. cyclomatic complexity: 49 Second operand 6 states. [2019-01-01 21:32:26,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:32:26,685 INFO L93 Difference]: Finished difference Result 117 states and 161 transitions. [2019-01-01 21:32:26,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 21:32:26,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 161 transitions. [2019-01-01 21:32:26,688 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 21:32:26,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 161 transitions. [2019-01-01 21:32:26,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-01-01 21:32:26,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-01-01 21:32:26,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 161 transitions. [2019-01-01 21:32:26,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:26,692 INFO L705 BuchiCegarLoop]: Abstraction has 117 states and 161 transitions. [2019-01-01 21:32:26,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 161 transitions. [2019-01-01 21:32:26,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2019-01-01 21:32:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-01 21:32:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2019-01-01 21:32:26,703 INFO L728 BuchiCegarLoop]: Abstraction has 113 states and 157 transitions. [2019-01-01 21:32:26,703 INFO L608 BuchiCegarLoop]: Abstraction has 113 states and 157 transitions. [2019-01-01 21:32:26,703 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:32:26,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 157 transitions. [2019-01-01 21:32:26,705 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 21:32:26,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:26,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:26,706 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:26,707 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:26,707 INFO L794 eck$LassoCheckResult]: Stem: 1425#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; 1426#L25 call main_#t~ret6 := rec2(main_~x~0);< 1442#rec2ENTRY ~j := #in~j; 1453#L18 assume !(~j <= 0); 1411#L20 call #t~ret3 := rec1(~j - 1);< 1452#rec1ENTRY ~i := #in~i; 1451#L12 assume !(~i <= 0); 1406#L14 call #t~ret0 := rec1(~i - 2);< 1450#rec1ENTRY ~i := #in~i; 1419#L12 assume ~i <= 0;#res := 0; 1405#rec1FINAL assume true; 1407#rec1EXIT >#27#return; 1399#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1397#rec1ENTRY ~i := #in~i; 1400#L12 assume ~i <= 0;#res := 0; 1493#rec1FINAL assume true; 1488#rec1EXIT >#29#return; 1421#L14-2 call #t~ret2 := rec1(#t~ret1);< 1422#rec1ENTRY ~i := #in~i; 1486#L12 assume ~i <= 0;#res := 0; 1485#rec1FINAL assume true; 1482#rec1EXIT >#31#return; 1415#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; 1416#rec1FINAL assume true; 1446#rec1EXIT >#33#return; 1392#L20-1 [2019-01-01 21:32:26,707 INFO L796 eck$LassoCheckResult]: Loop: 1392#L20-1 call #t~ret4 := rec2(#t~ret3);< 1391#rec2ENTRY ~j := #in~j; 1393#L18 assume !(~j <= 0); 1429#L20 call #t~ret3 := rec1(~j - 1);< 1434#rec1ENTRY ~i := #in~i; 1492#L12 assume !(~i <= 0); 1427#L14 call #t~ret0 := rec1(~i - 2);< 1434#rec1ENTRY ~i := #in~i; 1492#L12 assume ~i <= 0;#res := 0; 1487#rec1FINAL assume true; 1484#rec1EXIT >#27#return; 1398#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1397#rec1ENTRY ~i := #in~i; 1400#L12 assume ~i <= 0;#res := 0; 1493#rec1FINAL assume true; 1488#rec1EXIT >#29#return; 1483#L14-2 call #t~ret2 := rec1(#t~ret1);< 1422#rec1ENTRY ~i := #in~i; 1486#L12 assume ~i <= 0;#res := 0; 1485#rec1FINAL assume true; 1482#rec1EXIT >#31#return; 1445#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; 1457#rec1FINAL assume true; 1443#rec1EXIT >#33#return; 1392#L20-1 [2019-01-01 21:32:26,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:26,707 INFO L82 PathProgramCache]: Analyzing trace with hash -790062692, now seen corresponding path program 1 times [2019-01-01 21:32:26,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:26,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:26,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:26,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:26,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:26,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:26,726 INFO L82 PathProgramCache]: Analyzing trace with hash 125202860, now seen corresponding path program 1 times [2019-01-01 21:32:26,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:26,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:26,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:26,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:26,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:26,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:26,743 INFO L82 PathProgramCache]: Analyzing trace with hash -2019382713, now seen corresponding path program 1 times [2019-01-01 21:32:26,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:26,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:26,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:26,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:26,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 28 proven. 22 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-01-01 21:32:26,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:32:26,859 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:32:26,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:26,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 28 proven. 22 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-01-01 21:32:26,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:32:26,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-01 21:32:27,353 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:27,353 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:27,353 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:27,353 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:27,353 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:27,353 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:27,353 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:27,353 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:27,354 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2019-01-01 21:32:27,354 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:27,354 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:27,355 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:27,386 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:27,392 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:27,455 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:27,455 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:27,460 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:27,460 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:27,490 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:27,490 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:30,971 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:30,974 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:30,974 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:30,974 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:30,974 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:30,974 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:30,974 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:30,974 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:30,975 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:30,975 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2019-01-01 21:32:30,975 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:30,975 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:30,976 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,979 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,983 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,030 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:31,030 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:31,031 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,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:31,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:31,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:31,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:31,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:31,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:31,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:31,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:31,035 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,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:31,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:31,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:31,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:31,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:31,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:31,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:31,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:31,037 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,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:31,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:31,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:31,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:31,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:31,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:31,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:31,045 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:31,049 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:31,050 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:32:31,050 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:31,050 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:31,050 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:31,050 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#t~ret3) = 1*rec2_#t~ret3 Supporting invariants [] [2019-01-01 21:32:31,051 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:31,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:31,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:31,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-01 21:32:31,414 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2019-01-01 21:32:31,415 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 157 transitions. cyclomatic complexity: 51 Second operand 11 states. [2019-01-01 21:32:32,442 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 157 transitions. cyclomatic complexity: 51. Second operand 11 states. Result 584 states and 903 transitions. Complement of second has 45 states. [2019-01-01 21:32:32,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:32,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:32:32,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2019-01-01 21:32:32,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 25 letters. Loop has 24 letters. [2019-01-01 21:32:32,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:32,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 49 letters. Loop has 24 letters. [2019-01-01 21:32:32,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:32,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 25 letters. Loop has 48 letters. [2019-01-01 21:32:32,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:32,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 584 states and 903 transitions. [2019-01-01 21:32:32,461 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-01-01 21:32:32,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 584 states to 432 states and 649 transitions. [2019-01-01 21:32:32,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2019-01-01 21:32:32,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2019-01-01 21:32:32,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 432 states and 649 transitions. [2019-01-01 21:32:32,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:32,473 INFO L705 BuchiCegarLoop]: Abstraction has 432 states and 649 transitions. [2019-01-01 21:32:32,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states and 649 transitions. [2019-01-01 21:32:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 383. [2019-01-01 21:32:32,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-01-01 21:32:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 534 transitions. [2019-01-01 21:32:32,511 INFO L728 BuchiCegarLoop]: Abstraction has 383 states and 534 transitions. [2019-01-01 21:32:32,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 21:32:32,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-01 21:32:32,512 INFO L87 Difference]: Start difference. First operand 383 states and 534 transitions. Second operand 10 states. [2019-01-01 21:32:33,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:32:33,043 INFO L93 Difference]: Finished difference Result 442 states and 645 transitions. [2019-01-01 21:32:33,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 21:32:33,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 442 states and 645 transitions. [2019-01-01 21:32:33,051 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-01-01 21:32:33,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 442 states to 349 states and 495 transitions. [2019-01-01 21:32:33,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2019-01-01 21:32:33,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2019-01-01 21:32:33,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 349 states and 495 transitions. [2019-01-01 21:32:33,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:33,059 INFO L705 BuchiCegarLoop]: Abstraction has 349 states and 495 transitions. [2019-01-01 21:32:33,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states and 495 transitions. [2019-01-01 21:32:33,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 314. [2019-01-01 21:32:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-01-01 21:32:33,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 415 transitions. [2019-01-01 21:32:33,094 INFO L728 BuchiCegarLoop]: Abstraction has 314 states and 415 transitions. [2019-01-01 21:32:33,094 INFO L608 BuchiCegarLoop]: Abstraction has 314 states and 415 transitions. [2019-01-01 21:32:33,094 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:32:33,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 314 states and 415 transitions. [2019-01-01 21:32:33,097 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-01-01 21:32:33,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:33,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:33,099 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:33,099 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:32:33,099 INFO L794 eck$LassoCheckResult]: Stem: 3358#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; 3359#L25 call main_#t~ret6 := rec2(main_~x~0);< 3375#rec2ENTRY ~j := #in~j; 3398#L18 assume !(~j <= 0); 3336#L20 call #t~ret3 := rec1(~j - 1);< 3396#rec1ENTRY ~i := #in~i; 3411#L12 assume !(~i <= 0); 3407#L14 call #t~ret0 := rec1(~i - 2);< 3410#rec1ENTRY ~i := #in~i; 3415#L12 assume ~i <= 0;#res := 0; 3515#rec1FINAL assume true; 3512#rec1EXIT >#27#return; 3335#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 3337#rec1ENTRY ~i := #in~i; 3514#L12 assume ~i <= 0;#res := 0; 3513#rec1FINAL assume true; 3509#rec1EXIT >#29#return; 3317#L14-2 call #t~ret2 := rec1(#t~ret1);< 3316#rec1ENTRY ~i := #in~i; 3319#L12 assume ~i <= 0;#res := 0; 3508#rec1FINAL assume true; 3507#rec1EXIT >#31#return; 3340#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; 3341#rec1FINAL assume true; 3376#rec1EXIT >#33#return; 3377#L20-1 call #t~ret4 := rec2(#t~ret3);< 3496#rec2ENTRY ~j := #in~j; 3494#L18 assume !(~j <= 0); 3361#L20 call #t~ret3 := rec1(~j - 1);< 3491#rec1ENTRY ~i := #in~i; 3490#L12 assume !(~i <= 0); 3360#L14 call #t~ret0 := rec1(~i - 2);< 3363#rec1ENTRY [2019-01-01 21:32:33,099 INFO L796 eck$LassoCheckResult]: Loop: 3363#rec1ENTRY ~i := #in~i; 3464#L12 assume !(~i <= 0); 3445#L14 call #t~ret0 := rec1(~i - 2);< 3363#rec1ENTRY [2019-01-01 21:32:33,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:33,099 INFO L82 PathProgramCache]: Analyzing trace with hash -744961728, now seen corresponding path program 2 times [2019-01-01 21:32:33,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:33,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:33,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:33,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:33,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-01 21:32:33,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:32:33,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:32:33,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:32:33,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:32:33,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:32:33,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-01 21:32:33,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:32:33,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-01 21:32:33,313 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:32:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:33,313 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 3 times [2019-01-01 21:32:33,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:33,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:33,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:33,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:33,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:33,349 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:33,349 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:33,350 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:33,350 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:33,350 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:33,350 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:33,350 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:33,350 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:33,351 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2019-01-01 21:32:33,351 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:33,351 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:33,352 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:33,363 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:33,367 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:33,376 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:33,377 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:33,379 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:33,405 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:33,406 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:33,412 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:33,412 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:33,416 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:33,416 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 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:33,436 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:33,436 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:33,457 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:33,457 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:33,478 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:33,479 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:33,479 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:33,479 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:33,480 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:33,480 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:33,480 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:33,480 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:33,480 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:33,480 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2019-01-01 21:32:33,481 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:33,481 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:33,482 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:33,484 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:33,492 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:33,520 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:33,545 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:33,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:33,736 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:33,736 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:33,737 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:33,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:33,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:33,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:33,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:33,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:33,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:33,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:33,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:33,743 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:33,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:33,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:33,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:33,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:33,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:33,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:33,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:33,747 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:33,749 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-01 21:32:33,749 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:32:33,752 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:33,753 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:33,753 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:33,753 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-01-01 21:32:33,753 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:33,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:33,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:34,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:34,025 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:34,026 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:34,026 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 314 states and 415 transitions. cyclomatic complexity: 114 Second operand 5 states. [2019-01-01 21:32:34,120 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 314 states and 415 transitions. cyclomatic complexity: 114. Second operand 5 states. Result 348 states and 455 transitions. Complement of second has 14 states. [2019-01-01 21:32:34,123 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:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-01-01 21:32:34,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 32 letters. Loop has 3 letters. [2019-01-01 21:32:34,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:34,124 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:34,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:34,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:34,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:34,305 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:34,305 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:34,306 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 314 states and 415 transitions. cyclomatic complexity: 114 Second operand 5 states. [2019-01-01 21:32:34,462 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 314 states and 415 transitions. cyclomatic complexity: 114. Second operand 5 states. Result 348 states and 455 transitions. Complement of second has 14 states. [2019-01-01 21:32:34,462 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:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-01-01 21:32:34,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 32 letters. Loop has 3 letters. [2019-01-01 21:32:34,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:34,463 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:34,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:34,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:34,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:34,639 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:34,639 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:34,640 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 314 states and 415 transitions. cyclomatic complexity: 114 Second operand 5 states. [2019-01-01 21:32:34,949 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 314 states and 415 transitions. cyclomatic complexity: 114. Second operand 5 states. Result 485 states and 616 transitions. Complement of second has 16 states. [2019-01-01 21:32:34,952 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:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:34,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-01-01 21:32:34,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 32 letters. Loop has 3 letters. [2019-01-01 21:32:34,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:34,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 35 letters. Loop has 3 letters. [2019-01-01 21:32:34,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:34,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 32 letters. Loop has 6 letters. [2019-01-01 21:32:34,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:34,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 485 states and 616 transitions. [2019-01-01 21:32:34,964 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-01-01 21:32:34,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 485 states to 395 states and 526 transitions. [2019-01-01 21:32:34,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2019-01-01 21:32:34,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2019-01-01 21:32:34,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 395 states and 526 transitions. [2019-01-01 21:32:34,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:34,973 INFO L705 BuchiCegarLoop]: Abstraction has 395 states and 526 transitions. [2019-01-01 21:32:34,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states and 526 transitions. [2019-01-01 21:32:34,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 351. [2019-01-01 21:32:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-01-01 21:32:35,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 456 transitions. [2019-01-01 21:32:35,002 INFO L728 BuchiCegarLoop]: Abstraction has 351 states and 456 transitions. [2019-01-01 21:32:35,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 21:32:35,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-01 21:32:35,003 INFO L87 Difference]: Start difference. First operand 351 states and 456 transitions. Second operand 10 states. [2019-01-01 21:32:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:32:35,450 INFO L93 Difference]: Finished difference Result 378 states and 513 transitions. [2019-01-01 21:32:35,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 21:32:35,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 378 states and 513 transitions. [2019-01-01 21:32:35,459 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-01-01 21:32:35,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 378 states to 104 states and 142 transitions. [2019-01-01 21:32:35,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2019-01-01 21:32:35,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2019-01-01 21:32:35,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 142 transitions. [2019-01-01 21:32:35,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:35,462 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 142 transitions. [2019-01-01 21:32:35,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 142 transitions. [2019-01-01 21:32:35,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86. [2019-01-01 21:32:35,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-01 21:32:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2019-01-01 21:32:35,472 INFO L728 BuchiCegarLoop]: Abstraction has 86 states and 106 transitions. [2019-01-01 21:32:35,472 INFO L608 BuchiCegarLoop]: Abstraction has 86 states and 106 transitions. [2019-01-01 21:32:35,472 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:32:35,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 106 transitions. [2019-01-01 21:32:35,475 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-01-01 21:32:35,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:35,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:35,477 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:35,477 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:32:35,477 INFO L794 eck$LassoCheckResult]: Stem: 6075#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; 6076#L25 call main_#t~ret6 := rec2(main_~x~0);< 6080#rec2ENTRY ~j := #in~j; 6108#L18 assume !(~j <= 0); 6105#L20 call #t~ret3 := rec1(~j - 1);< 6107#rec1ENTRY ~i := #in~i; 6106#L12 assume !(~i <= 0); 6060#L14 call #t~ret0 := rec1(~i - 2);< 6082#rec1ENTRY ~i := #in~i; 6070#L12 assume !(~i <= 0); 6063#L14 [2019-01-01 21:32:35,477 INFO L796 eck$LassoCheckResult]: Loop: 6063#L14 call #t~ret0 := rec1(~i - 2);< 6113#rec1ENTRY ~i := #in~i; 6070#L12 assume !(~i <= 0); 6063#L14 [2019-01-01 21:32:35,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:35,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1371444593, now seen corresponding path program 3 times [2019-01-01 21:32:35,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:35,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:35,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:35,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:35,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:35,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:35,499 INFO L82 PathProgramCache]: Analyzing trace with hash 54781, now seen corresponding path program 4 times [2019-01-01 21:32:35,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:35,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:35,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:35,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:35,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:35,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:35,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1318041775, now seen corresponding path program 4 times [2019-01-01 21:32:35,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:35,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:35,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:35,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:35,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:35,575 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:35,575 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:35,576 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:35,576 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:35,576 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:35,576 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:35,576 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:35,576 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:35,577 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2019-01-01 21:32:35,577 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:35,577 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:35,578 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:35,589 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:35,591 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:35,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:35,595 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:35,628 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:35,628 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:35,631 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:35,632 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:35,656 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:35,656 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:39,442 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:39,444 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:39,445 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:39,445 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:39,445 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:39,445 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:39,445 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:39,445 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:39,445 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:39,445 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2019-01-01 21:32:39,446 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:39,446 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:39,446 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:39,464 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:39,470 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:39,472 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:39,473 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:39,501 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:39,502 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:39,502 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:39,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:39,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:39,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:39,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:39,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:39,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:39,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:39,513 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:39,516 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:39,516 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:32:39,518 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:39,518 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:39,518 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:39,518 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_~i) = 1*rec1_~i Supporting invariants [] [2019-01-01 21:32:39,518 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:39,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:39,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:39,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:39,644 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:39,644 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:39,644 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 106 transitions. cyclomatic complexity: 23 Second operand 4 states. [2019-01-01 21:32:39,687 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 106 transitions. cyclomatic complexity: 23. Second operand 4 states. Result 100 states and 124 transitions. Complement of second has 11 states. [2019-01-01 21:32:39,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:39,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:32:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-01-01 21:32:39,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-01 21:32:39,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:39,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 13 letters. Loop has 3 letters. [2019-01-01 21:32:39,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:39,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 21:32:39,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:39,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 124 transitions. [2019-01-01 21:32:39,696 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-01-01 21:32:39,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 94 states and 117 transitions. [2019-01-01 21:32:39,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2019-01-01 21:32:39,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2019-01-01 21:32:39,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 117 transitions. [2019-01-01 21:32:39,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:39,702 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 117 transitions. [2019-01-01 21:32:39,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 117 transitions. [2019-01-01 21:32:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2019-01-01 21:32:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-01 21:32:39,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2019-01-01 21:32:39,708 INFO L728 BuchiCegarLoop]: Abstraction has 92 states and 114 transitions. [2019-01-01 21:32:39,708 INFO L608 BuchiCegarLoop]: Abstraction has 92 states and 114 transitions. [2019-01-01 21:32:39,708 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 21:32:39,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 114 transitions. [2019-01-01 21:32:39,709 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-01-01 21:32:39,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:39,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:39,714 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:39,714 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-01 21:32:39,714 INFO L794 eck$LassoCheckResult]: Stem: 6332#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; 6333#L25 call main_#t~ret6 := rec2(main_~x~0);< 6339#rec2ENTRY ~j := #in~j; 6338#L18 assume !(~j <= 0); 6334#L20 call #t~ret3 := rec1(~j - 1);< 6362#rec1ENTRY ~i := #in~i; 6363#L12 assume !(~i <= 0); 6318#L14 call #t~ret0 := rec1(~i - 2);< 6335#rec1ENTRY ~i := #in~i; 6366#L12 assume !(~i <= 0); 6301#L14 call #t~ret0 := rec1(~i - 2);< 6300#rec1ENTRY ~i := #in~i; 6302#L12 assume ~i <= 0;#res := 0; 6307#rec1FINAL assume true; 6308#rec1EXIT >#27#return; 6331#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 6379#rec1ENTRY ~i := #in~i; 6381#L12 assume ~i <= 0;#res := 0; 6380#rec1FINAL assume true; 6378#rec1EXIT >#29#return; 6346#L14-2 call #t~ret2 := rec1(#t~ret1);< 6347#rec1ENTRY ~i := #in~i; 6361#L12 assume ~i <= 0;#res := 0; 6358#rec1FINAL assume true; 6351#rec1EXIT >#31#return; 6317#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; 6325#rec1FINAL assume true; 6350#rec1EXIT >#27#return; 6320#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 6349#rec1ENTRY [2019-01-01 21:32:39,714 INFO L796 eck$LassoCheckResult]: Loop: 6349#rec1ENTRY ~i := #in~i; 6354#L12 assume !(~i <= 0); 6324#L14 call #t~ret0 := rec1(~i - 2);< 6353#rec1ENTRY ~i := #in~i; 6374#L12 assume !(~i <= 0); 6319#L14 call #t~ret0 := rec1(~i - 2);< 6336#rec1ENTRY ~i := #in~i; 6326#L12 assume ~i <= 0;#res := 0; 6327#rec1FINAL assume true; 6364#rec1EXIT >#27#return; 6331#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 6379#rec1ENTRY ~i := #in~i; 6381#L12 assume ~i <= 0;#res := 0; 6380#rec1FINAL assume true; 6378#rec1EXIT >#29#return; 6346#L14-2 call #t~ret2 := rec1(#t~ret1);< 6347#rec1ENTRY ~i := #in~i; 6361#L12 assume ~i <= 0;#res := 0; 6358#rec1FINAL assume true; 6351#rec1EXIT >#31#return; 6317#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; 6325#rec1FINAL assume true; 6350#rec1EXIT >#27#return; 6321#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 6349#rec1ENTRY [2019-01-01 21:32:39,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:39,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1733863270, now seen corresponding path program 1 times [2019-01-01 21:32:39,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:39,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:39,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:39,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:39,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:39,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:39,735 INFO L82 PathProgramCache]: Analyzing trace with hash -165506564, now seen corresponding path program 1 times [2019-01-01 21:32:39,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:39,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:39,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:39,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:39,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:39,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:39,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2126813793, now seen corresponding path program 2 times [2019-01-01 21:32:39,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:39,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:39,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:39,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:39,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 24 proven. 29 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-01-01 21:32:39,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:32:39,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:32:39,840 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:32:39,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:32:39,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:32:39,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:39,864 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-01-01 21:32:39,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:32:39,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 21:32:40,128 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:40,129 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:40,129 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:40,129 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:40,129 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:40,129 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:40,130 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:40,130 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:40,130 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Loop [2019-01-01 21:32:40,130 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:40,130 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:40,131 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:40,135 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:40,142 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:40,144 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:40,153 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:40,154 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:40,190 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:40,191 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:40,195 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:40,196 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:40,198 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:40,198 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 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:40,219 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:40,219 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:40,222 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:40,222 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 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:40,243 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:40,243 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:40,246 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:40,246 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 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:40,267 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:40,267 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:40,289 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:40,289 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:40,293 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:40,311 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:40,311 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:40,311 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:40,311 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:40,311 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:40,311 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:40,311 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:40,311 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:40,312 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Loop [2019-01-01 21:32:40,312 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:40,312 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:40,312 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:40,342 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:40,364 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:40,395 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:40,397 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:40,403 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:40,430 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:40,430 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:40,432 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:40,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:40,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:40,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:40,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:40,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:40,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:40,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:40,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:40,436 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:40,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:40,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:40,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:40,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:40,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:40,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:40,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:40,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:40,442 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:40,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:40,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:40,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:40,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:40,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:40,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:40,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:40,447 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:40,452 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:40,453 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:32:40,453 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:40,453 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:40,453 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:40,453 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-01-01 21:32:40,454 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:40,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:40,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:40,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:40,750 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-01 21:32:40,751 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2019-01-01 21:32:40,751 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26 Second operand 11 states. [2019-01-01 21:32:40,819 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26. Second operand 11 states. Result 100 states and 122 transitions. Complement of second has 7 states. [2019-01-01 21:32:40,820 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:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:32:40,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-01 21:32:40,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 29 letters. Loop has 24 letters. [2019-01-01 21:32:40,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:40,821 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:40,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:40,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:40,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-01 21:32:41,062 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2019-01-01 21:32:41,062 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26 Second operand 11 states. [2019-01-01 21:32:41,132 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26. Second operand 11 states. Result 100 states and 122 transitions. Complement of second has 7 states. [2019-01-01 21:32:41,133 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:41,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:32:41,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-01 21:32:41,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 29 letters. Loop has 24 letters. [2019-01-01 21:32:41,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:41,134 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:41,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:41,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:41,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-01 21:32:41,472 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 9 loop predicates [2019-01-01 21:32:41,473 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26 Second operand 11 states. [2019-01-01 21:32:41,845 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26. Second operand 11 states. Result 257 states and 303 transitions. Complement of second has 31 states. [2019-01-01 21:32:41,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:32:41,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2019-01-01 21:32:41,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 38 transitions. Stem has 29 letters. Loop has 24 letters. [2019-01-01 21:32:41,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:41,848 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:41,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:41,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:42,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-01 21:32:42,150 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2019-01-01 21:32:42,151 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26 Second operand 11 states. [2019-01-01 21:32:42,950 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26. Second operand 11 states. Result 409 states and 515 transitions. Complement of second has 80 states. [2019-01-01 21:32:42,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:32:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 49 transitions. [2019-01-01 21:32:42,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 49 transitions. Stem has 29 letters. Loop has 24 letters. [2019-01-01 21:32:42,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:42,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 49 transitions. Stem has 53 letters. Loop has 24 letters. [2019-01-01 21:32:42,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:42,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 49 transitions. Stem has 29 letters. Loop has 48 letters. [2019-01-01 21:32:42,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:42,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 409 states and 515 transitions. [2019-01-01 21:32:42,964 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2019-01-01 21:32:42,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 409 states to 253 states and 345 transitions. [2019-01-01 21:32:42,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2019-01-01 21:32:42,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 164 [2019-01-01 21:32:42,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 253 states and 345 transitions. [2019-01-01 21:32:42,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:42,970 INFO L705 BuchiCegarLoop]: Abstraction has 253 states and 345 transitions. [2019-01-01 21:32:42,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states and 345 transitions. [2019-01-01 21:32:42,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 216. [2019-01-01 21:32:42,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-01-01 21:32:42,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 270 transitions. [2019-01-01 21:32:42,982 INFO L728 BuchiCegarLoop]: Abstraction has 216 states and 270 transitions. [2019-01-01 21:32:42,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 21:32:42,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 21:32:42,982 INFO L87 Difference]: Start difference. First operand 216 states and 270 transitions. Second operand 8 states. [2019-01-01 21:32:43,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:32:43,073 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-01-01 21:32:43,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 21:32:43,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2019-01-01 21:32:43,076 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:32:43,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2019-01-01 21:32:43,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:32:43,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:32:43,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:32:43,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:32:43,077 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:43,077 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:43,077 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:43,077 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 21:32:43,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:32:43,081 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:32:43,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:32:43,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:32:43 BoogieIcfgContainer [2019-01-01 21:32:43,091 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:32:43,091 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:32:43,091 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:32:43,091 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:32:43,092 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:21" (3/4) ... [2019-01-01 21:32:43,100 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:32:43,100 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:32:43,100 INFO L168 Benchmark]: Toolchain (without parser) took 22819.04 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.1 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -249.0 MB). Peak memory consumption was 76.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:43,103 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:43,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.47 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:43,104 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.34 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:43,105 INFO L168 Benchmark]: Boogie Preprocessor took 25.85 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:43,107 INFO L168 Benchmark]: RCFGBuilder took 465.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -199.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:43,108 INFO L168 Benchmark]: BuchiAutomizer took 21956.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 162.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -60.6 MB). Peak memory consumption was 102.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:43,108 INFO L168 Benchmark]: Witness Printer took 8.55 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:43,112 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 314.47 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 42.34 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 25.85 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 465.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -199.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21956.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 162.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -60.6 MB). Peak memory consumption was 102.0 MB. Max. memory is 11.5 GB. * Witness Printer took 8.55 ms. Allocated memory is still 1.4 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 12 terminating modules (5 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(j) and consists of 11 locations. One deterministic module has affine ranking function \old(i) and consists of 4 locations. One deterministic module has affine ranking function \old(i) and consists of 5 locations. One deterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15238688 and consists of 11 locations. One deterministic module has affine ranking function i and consists of 5 locations. One nondeterministic module has affine ranking function \old(i) and consists of 5 locations. One nondeterministic module has affine ranking function \old(i) and consists of 15 locations. 5 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.8s and 9 iterations. TraceHistogramMax:5. Analysis of lassos took 12.4s. Construction of modules took 2.8s. Büchi inclusion checks took 6.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 249 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 314 states and ocurred in iteration 5. Nontrivial modules had stage [5, 0, 1, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 38/58 HoareTripleCheckerStatistics: 288 SDtfs, 336 SDslu, 538 SDs, 0 SdLazy, 951 SolverSat, 311 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT3 conc0 concLT3 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf98 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf92 smp100 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 7.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...