./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1d_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 0837a1e1d82be1b28ccf3514392f1b01c88a9160 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:14:57,957 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:14:57,959 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:14:57,972 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:14:57,972 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:14:57,973 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:14:57,975 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:14:57,977 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:14:57,978 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:14:57,979 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:14:57,980 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:14:57,980 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:14:57,982 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:14:57,983 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:14:57,984 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:14:57,985 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:14:57,986 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:14:57,988 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:14:57,990 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:14:57,992 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:14:57,993 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:14:57,994 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:14:57,997 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:14:57,997 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:14:57,997 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:14:57,998 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:14:57,999 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:14:58,001 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:14:58,001 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:14:58,003 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:14:58,003 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:14:58,004 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:14:58,004 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:14:58,004 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:14:58,006 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:14:58,006 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:14:58,007 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:14:58,023 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:14:58,024 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:14:58,025 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:14:58,025 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:14:58,025 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:14:58,026 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:14:58,026 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:14:58,026 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:14:58,026 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:14:58,026 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:14:58,026 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:14:58,027 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:14:58,027 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:14:58,027 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:14:58,027 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:14:58,027 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:14:58,027 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:14:58,028 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:14:58,029 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:14:58,029 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:14:58,030 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:14:58,030 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:14:58,030 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:14:58,030 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:14:58,030 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:14:58,031 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:14:58,032 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:14:58,032 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:14:58,033 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:14:58,033 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 -> 0837a1e1d82be1b28ccf3514392f1b01c88a9160 [2019-01-14 02:14:58,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:14:58,081 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:14:58,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:14:58,087 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:14:58,087 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:14:58,088 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 02:14:58,143 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf77196b/9a32061d98f14a6497aa8d96c878075d/FLAG4519382ea [2019-01-14 02:14:58,548 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:14:58,548 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 02:14:58,554 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf77196b/9a32061d98f14a6497aa8d96c878075d/FLAG4519382ea [2019-01-14 02:14:58,933 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf77196b/9a32061d98f14a6497aa8d96c878075d [2019-01-14 02:14:58,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:14:58,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:14:58,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:14:58,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:14:58,944 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:14:58,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:14:58" (1/1) ... [2019-01-14 02:14:58,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18591238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:58, skipping insertion in model container [2019-01-14 02:14:58,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:14:58" (1/1) ... [2019-01-14 02:14:58,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:14:58,979 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:14:59,153 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:14:59,159 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:14:59,180 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:14:59,199 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:14:59,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:59 WrapperNode [2019-01-14 02:14:59,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:14:59,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:14:59,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:14:59,201 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:14:59,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:59" (1/1) ... [2019-01-14 02:14:59,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:59" (1/1) ... [2019-01-14 02:14:59,246 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:14:59,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:14:59,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:14:59,247 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:14:59,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:59" (1/1) ... [2019-01-14 02:14:59,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:59" (1/1) ... [2019-01-14 02:14:59,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:59" (1/1) ... [2019-01-14 02:14:59,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:59" (1/1) ... [2019-01-14 02:14:59,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:59" (1/1) ... [2019-01-14 02:14:59,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:59" (1/1) ... [2019-01-14 02:14:59,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:59" (1/1) ... [2019-01-14 02:14:59,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:14:59,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:14:59,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:14:59,274 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:14:59,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-01-14 02:14:59,392 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-01-14 02:14:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-01-14 02:14:59,392 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-01-14 02:14:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:14:59,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:14:59,634 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:14:59,635 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 02:14:59,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:14:59 BoogieIcfgContainer [2019-01-14 02:14:59,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:14:59,639 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:14:59,640 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:14:59,645 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:14:59,648 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:14:59,648 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:14:58" (1/3) ... [2019-01-14 02:14:59,650 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11b0bf48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:14:59, skipping insertion in model container [2019-01-14 02:14:59,650 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:14:59,652 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:59" (2/3) ... [2019-01-14 02:14:59,652 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11b0bf48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:14:59, skipping insertion in model container [2019-01-14 02:14:59,653 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:14:59,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:14:59" (3/3) ... [2019-01-14 02:14:59,655 INFO L375 chiAutomizerObserver]: Analyzing ICFG NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 02:14:59,772 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:14:59,775 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:14:59,777 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:14:59,777 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:14:59,777 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:14:59,777 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:14:59,777 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:14:59,778 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:14:59,778 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:14:59,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-14 02:14:59,838 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 02:14:59,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:59,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:59,848 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:14:59,848 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:14:59,848 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:14:59,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-14 02:14:59,851 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 02:14:59,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:59,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:59,852 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:14:59,852 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:14:59,860 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-14 02:14:59,860 INFO L796 eck$LassoCheckResult]: Loop: 3#rec2ENTRYtrue ~j := #in~j; 20#L18true assume !(~j <= 0); 18#L20true call #t~ret3 := rec1(~j);< 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 - 1);< 3#rec2ENTRYtrue [2019-01-14 02:14:59,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:59,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1617, now seen corresponding path program 1 times [2019-01-14 02:14:59,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:59,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:59,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:59,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:59,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:59,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:59,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1102838740, now seen corresponding path program 1 times [2019-01-14 02:14:59,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:59,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:59,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:59,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:59,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:00,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:15:00,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:15:00,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 02:15:00,085 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:15:00,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:15:00,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:15:00,101 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2019-01-14 02:15:00,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:15:00,256 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-14 02:15:00,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:15:00,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2019-01-14 02:15:00,263 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 02:15:00,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 16 states and 22 transitions. [2019-01-14 02:15:00,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 02:15:00,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-14 02:15:00,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-01-14 02:15:00,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:15:00,275 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-14 02:15:00,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-01-14 02:15:00,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-14 02:15:00,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 02:15:00,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-01-14 02:15:00,310 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-14 02:15:00,310 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-14 02:15:00,310 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:15:00,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-01-14 02:15:00,312 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 02:15:00,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:15:00,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:15:00,314 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:15:00,314 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:15:00,314 INFO L794 eck$LassoCheckResult]: Stem: 73#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; 60#L25 call main_#t~ret6 := rec2(main_~x~0);< 59#rec2ENTRY [2019-01-14 02:15:00,314 INFO L796 eck$LassoCheckResult]: Loop: 59#rec2ENTRY ~j := #in~j; 62#L18 assume !(~j <= 0); 66#L20 call #t~ret3 := rec1(~j);< 63#rec1ENTRY ~i := #in~i; 68#L12 assume !(~i <= 0); 67#L14 call #t~ret0 := rec1(~i - 2);< 63#rec1ENTRY ~i := #in~i; 68#L12 assume ~i <= 0;#res := 0; 69#rec1FINAL assume true; 70#rec1EXIT >#27#return; 64#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 63#rec1ENTRY ~i := #in~i; 68#L12 assume ~i <= 0;#res := 0; 69#rec1FINAL assume true; 70#rec1EXIT >#29#return; 65#L14-2 call #t~ret2 := rec1(#t~ret1);< 63#rec1ENTRY ~i := #in~i; 68#L12 assume ~i <= 0;#res := 0; 69#rec1FINAL assume true; 70#rec1EXIT >#31#return; 71#L14-3 #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret1;havoc #t~ret0; 72#rec1FINAL assume true; 74#rec1EXIT >#33#return; 61#L20-1 call #t~ret4 := rec2(#t~ret3 - 1);< 59#rec2ENTRY [2019-01-14 02:15:00,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:00,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1617, now seen corresponding path program 2 times [2019-01-14 02:15:00,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:00,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:00,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:00,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:15:00,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:00,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:00,324 INFO L82 PathProgramCache]: Analyzing trace with hash -616266826, now seen corresponding path program 1 times [2019-01-14 02:15:00,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:00,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:00,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:00,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:15:00,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:00,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:00,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1277860358, now seen corresponding path program 1 times [2019-01-14 02:15:00,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:00,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:00,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:00,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:15:00,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:01,109 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-14 02:15:01,369 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2019-01-14 02:15:01,526 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 02:15:01,606 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:15:01,607 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:15:01,607 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:15:01,608 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:15:01,608 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:15:01,608 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:01,608 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:15:01,608 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:15:01,608 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-14 02:15:01,609 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:15:01,609 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:15:01,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:01,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:01,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:01,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:01,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:01,733 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:15:01,734 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-14 02:15:01,743 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:01,743 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:01,755 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:01,755 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) [2019-01-14 02:15:01,803 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:01,804 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:01,819 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:01,819 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) [2019-01-14 02:15:01,864 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:01,864 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:01,882 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:01,882 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-14 02:15:01,930 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:01,931 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:01,945 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:01,945 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) [2019-01-14 02:15:01,981 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:01,981 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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-14 02:15:02,019 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:15:02,019 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:02,031 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:15:02,048 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:15:02,048 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:15:02,048 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:15:02,048 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:15:02,049 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:15:02,049 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:02,049 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:15:02,049 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:15:02,049 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-14 02:15:02,049 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:15:02,049 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:15:02,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:02,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:02,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:02,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:02,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:02,159 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:15:02,164 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:15:02,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:02,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:02,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:02,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:02,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:02,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:02,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:02,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:02,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:02,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:02,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:02,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:02,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:02,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:02,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:02,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:02,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:02,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:02,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:02,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:02,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:02,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:02,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:02,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:02,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:02,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:02,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:02,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:02,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:02,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:02,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:02,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:02,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:02,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:02,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:02,191 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:15:02,196 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:15:02,196 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:15:02,198 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:15:02,198 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:15:02,199 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:15:02,199 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#in~j) = 1*rec2_#in~j Supporting invariants [] [2019-01-14 02:15:02,200 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:15:02,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:02,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:02,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-14 02:15:02,903 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2019-01-14 02:15:02,904 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand 9 states. [2019-01-14 02:15:03,944 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8. Second operand 9 states. Result 101 states and 147 transitions. Complement of second has 42 states. [2019-01-14 02:15:03,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2019-01-14 02:15:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:15:03,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2019-01-14 02:15:03,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 2 letters. Loop has 24 letters. [2019-01-14 02:15:03,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:03,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 26 letters. Loop has 24 letters. [2019-01-14 02:15:03,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:03,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 2 letters. Loop has 48 letters. [2019-01-14 02:15:03,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:03,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 147 transitions. [2019-01-14 02:15:03,962 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 02:15:03,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 89 states and 135 transitions. [2019-01-14 02:15:03,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-01-14 02:15:03,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-01-14 02:15:03,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 135 transitions. [2019-01-14 02:15:03,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:15:03,971 INFO L706 BuchiCegarLoop]: Abstraction has 89 states and 135 transitions. [2019-01-14 02:15:03,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 135 transitions. [2019-01-14 02:15:03,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2019-01-14 02:15:03,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-14 02:15:03,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 98 transitions. [2019-01-14 02:15:03,991 INFO L729 BuchiCegarLoop]: Abstraction has 62 states and 98 transitions. [2019-01-14 02:15:03,991 INFO L609 BuchiCegarLoop]: Abstraction has 62 states and 98 transitions. [2019-01-14 02:15:03,991 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:15:03,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 98 transitions. [2019-01-14 02:15:03,994 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 02:15:03,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:15:03,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:15:03,995 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:15:03,995 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:15:03,995 INFO L794 eck$LassoCheckResult]: Stem: 371#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; 334#L25 call main_#t~ret6 := rec2(main_~x~0);< 333#rec2ENTRY ~j := #in~j; 336#L18 assume !(~j <= 0); 366#L20 call #t~ret3 := rec1(~j);< 378#rec1ENTRY ~i := #in~i; 365#L12 assume !(~i <= 0); 345#L14 call #t~ret0 := rec1(~i - 2);< 339#rec1ENTRY [2019-01-14 02:15:03,996 INFO L796 eck$LassoCheckResult]: Loop: 339#rec1ENTRY ~i := #in~i; 347#L12 assume !(~i <= 0); 344#L14 call #t~ret0 := rec1(~i - 2);< 339#rec1ENTRY [2019-01-14 02:15:03,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:03,996 INFO L82 PathProgramCache]: Analyzing trace with hash 874549579, now seen corresponding path program 1 times [2019-01-14 02:15:03,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:03,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:03,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:03,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:15:03,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:04,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:04,007 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 1 times [2019-01-14 02:15:04,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:04,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:04,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:04,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:15:04,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:04,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:04,014 INFO L82 PathProgramCache]: Analyzing trace with hash 434890603, now seen corresponding path program 2 times [2019-01-14 02:15:04,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:04,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:04,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:04,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:15:04,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:04,083 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:15:04,083 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:15:04,083 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:15:04,083 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:15:04,084 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:15:04,084 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:04,084 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:15:04,084 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:15:04,085 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-14 02:15:04,085 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:15:04,085 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:15:04,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:04,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:04,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:04,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:04,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:04,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:04,170 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:15:04,170 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) [2019-01-14 02:15:04,183 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:04,183 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:04,188 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:04,188 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 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-14 02:15:04,209 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:04,209 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:04,211 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:04,211 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 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-14 02:15:04,233 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:04,234 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:04,237 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:04,237 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 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-14 02:15:04,258 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:04,259 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:04,261 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:04,262 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 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-14 02:15:04,285 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:04,285 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-14 02:15:04,311 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:15:04,311 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:04,336 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:15:04,338 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:15:04,338 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:15:04,338 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:15:04,338 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:15:04,338 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:15:04,338 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:04,339 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:15:04,339 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:15:04,339 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-14 02:15:04,339 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:15:04,339 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:15:04,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:04,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:04,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:04,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-14 02:15:04,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:04,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:04,458 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:15:04,459 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:15:04,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:04,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:04,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:04,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:04,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:04,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:04,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:04,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:04,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:04,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:04,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:04,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:04,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:04,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:04,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:04,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:04,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:04,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:04,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:04,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:04,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:04,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:04,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:04,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:04,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:04,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:04,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:04,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:04,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:04,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:04,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:04,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:04,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:04,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:04,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:04,488 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:15:04,491 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-14 02:15:04,491 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:15:04,491 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:15:04,491 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:15:04,492 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:15:04,492 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-01-14 02:15:04,492 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:15:04,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:04,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:04,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:15:04,613 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-14 02:15:04,613 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 98 transitions. cyclomatic complexity: 40 Second operand 4 states. [2019-01-14 02:15:04,678 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 98 transitions. cyclomatic complexity: 40. Second operand 4 states. Result 108 states and 165 transitions. Complement of second has 13 states. [2019-01-14 02:15:04,683 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-14 02:15:04,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:15:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-14 02:15:04,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-14 02:15:04,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:04,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-14 02:15:04,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:04,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-14 02:15:04,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:04,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 165 transitions. [2019-01-14 02:15:04,690 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 02:15:04,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 96 states and 153 transitions. [2019-01-14 02:15:04,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-01-14 02:15:04,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-01-14 02:15:04,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 153 transitions. [2019-01-14 02:15:04,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:15:04,698 INFO L706 BuchiCegarLoop]: Abstraction has 96 states and 153 transitions. [2019-01-14 02:15:04,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 153 transitions. [2019-01-14 02:15:04,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2019-01-14 02:15:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 02:15:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 143 transitions. [2019-01-14 02:15:04,714 INFO L729 BuchiCegarLoop]: Abstraction has 92 states and 143 transitions. [2019-01-14 02:15:04,714 INFO L609 BuchiCegarLoop]: Abstraction has 92 states and 143 transitions. [2019-01-14 02:15:04,714 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:15:04,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 143 transitions. [2019-01-14 02:15:04,717 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 02:15:04,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:15:04,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:15:04,718 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:15:04,718 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:15:04,719 INFO L794 eck$LassoCheckResult]: Stem: 604#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; 605#L25 call main_#t~ret6 := rec2(main_~x~0);< 609#rec2ENTRY ~j := #in~j; 629#L18 assume !(~j <= 0); 576#L20 call #t~ret3 := rec1(~j);< 575#rec1ENTRY ~i := #in~i; 577#L12 assume !(~i <= 0); 595#L14 call #t~ret0 := rec1(~i - 2);< 606#rec1ENTRY ~i := #in~i; 641#L12 assume ~i <= 0;#res := 0; 640#rec1FINAL assume true; 614#rec1EXIT >#27#return; 588#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 590#rec1ENTRY [2019-01-14 02:15:04,719 INFO L796 eck$LassoCheckResult]: Loop: 590#rec1ENTRY ~i := #in~i; 624#L12 assume !(~i <= 0); 596#L14 call #t~ret0 := rec1(~i - 2);< 590#rec1ENTRY [2019-01-14 02:15:04,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:04,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1317996508, now seen corresponding path program 1 times [2019-01-14 02:15:04,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:04,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:04,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:04,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:15:04,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:04,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:04,732 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 2 times [2019-01-14 02:15:04,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:04,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:04,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:04,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:15:04,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:04,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:04,737 INFO L82 PathProgramCache]: Analyzing trace with hash -157050054, now seen corresponding path program 2 times [2019-01-14 02:15:04,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:04,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:04,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:04,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:15:04,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:04,807 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-14 02:15:04,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:15:04,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 02:15:04,870 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:15:04,870 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:15:04,870 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:15:04,870 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:15:04,870 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:15:04,870 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:04,870 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:15:04,870 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:15:04,871 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2019-01-14 02:15:04,871 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:15:04,871 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:15:04,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:04,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:04,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:04,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-14 02:15:04,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-14 02:15:04,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:04,958 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:15:04,958 INFO L412 LassoAnalysis]: Checking for nontermination... 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-14 02:15:04,963 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:04,963 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:04,966 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:04,966 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 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-14 02:15:04,987 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:04,987 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:04,990 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:04,990 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 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-14 02:15:05,011 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:05,012 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:05,014 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:05,014 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 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-14 02:15:05,036 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:05,036 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:05,061 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:15:05,061 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:05,084 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:15:05,085 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:15:05,085 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:15:05,086 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:15:05,086 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:15:05,086 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:15:05,086 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:05,086 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:15:05,086 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:15:05,086 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2019-01-14 02:15:05,086 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:15:05,086 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:15:05,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:05,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:05,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:05,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:05,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:05,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:05,150 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:15:05,151 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:15:05,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:05,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:05,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:05,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:05,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:05,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:05,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:05,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:05,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:05,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:05,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:05,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:05,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:05,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:05,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:05,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:05,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:05,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:05,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:05,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:05,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:05,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:05,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:05,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:05,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:05,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:05,168 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:15:05,171 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-14 02:15:05,171 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:15:05,171 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:15:05,171 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:15:05,172 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:15:05,172 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-01-14 02:15:05,172 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:15:05,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:05,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:05,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:15:05,285 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-14 02:15:05,285 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 143 transitions. cyclomatic complexity: 57 Second operand 5 states. [2019-01-14 02:15:05,381 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 143 transitions. cyclomatic complexity: 57. Second operand 5 states. Result 132 states and 207 transitions. Complement of second has 14 states. [2019-01-14 02:15:05,386 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-14 02:15:05,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:15:05,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-01-14 02:15:05,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 13 letters. Loop has 3 letters. [2019-01-14 02:15:05,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:05,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 16 letters. Loop has 3 letters. [2019-01-14 02:15:05,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:05,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 13 letters. Loop has 6 letters. [2019-01-14 02:15:05,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:05,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 207 transitions. [2019-01-14 02:15:05,397 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 02:15:05,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 120 states and 195 transitions. [2019-01-14 02:15:05,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2019-01-14 02:15:05,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2019-01-14 02:15:05,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 195 transitions. [2019-01-14 02:15:05,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:15:05,411 INFO L706 BuchiCegarLoop]: Abstraction has 120 states and 195 transitions. [2019-01-14 02:15:05,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 195 transitions. [2019-01-14 02:15:05,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2019-01-14 02:15:05,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-14 02:15:05,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 185 transitions. [2019-01-14 02:15:05,440 INFO L729 BuchiCegarLoop]: Abstraction has 116 states and 185 transitions. [2019-01-14 02:15:05,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:15:05,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:15:05,440 INFO L87 Difference]: Start difference. First operand 116 states and 185 transitions. Second operand 6 states. [2019-01-14 02:15:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:15:05,530 INFO L93 Difference]: Finished difference Result 129 states and 195 transitions. [2019-01-14 02:15:05,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:15:05,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 195 transitions. [2019-01-14 02:15:05,535 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-14 02:15:05,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 127 states and 193 transitions. [2019-01-14 02:15:05,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2019-01-14 02:15:05,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-01-14 02:15:05,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 193 transitions. [2019-01-14 02:15:05,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:15:05,540 INFO L706 BuchiCegarLoop]: Abstraction has 127 states and 193 transitions. [2019-01-14 02:15:05,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 193 transitions. [2019-01-14 02:15:05,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 104. [2019-01-14 02:15:05,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 02:15:05,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 157 transitions. [2019-01-14 02:15:05,553 INFO L729 BuchiCegarLoop]: Abstraction has 104 states and 157 transitions. [2019-01-14 02:15:05,553 INFO L609 BuchiCegarLoop]: Abstraction has 104 states and 157 transitions. [2019-01-14 02:15:05,553 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:15:05,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 157 transitions. [2019-01-14 02:15:05,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 02:15:05,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:15:05,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:15:05,556 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:15:05,557 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 02:15:05,557 INFO L794 eck$LassoCheckResult]: Stem: 1181#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; 1182#L25 call main_#t~ret6 := rec2(main_~x~0);< 1187#rec2ENTRY ~j := #in~j; 1200#L18 assume !(~j <= 0); 1150#L20 call #t~ret3 := rec1(~j);< 1199#rec1ENTRY ~i := #in~i; 1198#L12 assume !(~i <= 0); 1146#L14 call #t~ret0 := rec1(~i - 2);< 1196#rec1ENTRY ~i := #in~i; 1195#L12 assume !(~i <= 0); 1168#L14 call #t~ret0 := rec1(~i - 2);< 1194#rec1ENTRY ~i := #in~i; 1197#L12 assume ~i <= 0;#res := 0; 1213#rec1FINAL assume true; 1212#rec1EXIT >#27#return; 1139#L14-1 [2019-01-14 02:15:05,557 INFO L796 eck$LassoCheckResult]: Loop: 1139#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1137#rec1ENTRY ~i := #in~i; 1140#L12 assume ~i <= 0;#res := 0; 1216#rec1FINAL assume true; 1207#rec1EXIT >#29#return; 1164#L14-2 call #t~ret2 := rec1(#t~ret1);< 1178#rec1ENTRY ~i := #in~i; 1210#L12 assume !(~i <= 0); 1162#L14 call #t~ret0 := rec1(~i - 2);< 1178#rec1ENTRY ~i := #in~i; 1210#L12 assume ~i <= 0;#res := 0; 1209#rec1FINAL assume true; 1208#rec1EXIT >#27#return; 1139#L14-1 [2019-01-14 02:15:05,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:05,557 INFO L82 PathProgramCache]: Analyzing trace with hash -377207200, now seen corresponding path program 1 times [2019-01-14 02:15:05,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:05,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:05,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:05,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:15:05,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:05,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:05,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1306212703, now seen corresponding path program 1 times [2019-01-14 02:15:05,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:05,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:05,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:05,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:15:05,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:05,855 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-14 02:15:05,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:15:05,856 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-14 02:15:05,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:15:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:05,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:05,884 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-14 02:15:05,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 02:15:05,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2019-01-14 02:15:05,905 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:15:05,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:15:05,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:15:05,905 INFO L87 Difference]: Start difference. First operand 104 states and 157 transitions. cyclomatic complexity: 59 Second operand 6 states. [2019-01-14 02:15:05,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:15:05,970 INFO L93 Difference]: Finished difference Result 119 states and 173 transitions. [2019-01-14 02:15:05,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:15:05,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 173 transitions. [2019-01-14 02:15:05,980 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 02:15:05,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 114 states and 164 transitions. [2019-01-14 02:15:05,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2019-01-14 02:15:05,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2019-01-14 02:15:05,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 164 transitions. [2019-01-14 02:15:05,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:15:05,985 INFO L706 BuchiCegarLoop]: Abstraction has 114 states and 164 transitions. [2019-01-14 02:15:05,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 164 transitions. [2019-01-14 02:15:05,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-01-14 02:15:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-14 02:15:06,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2019-01-14 02:15:06,000 INFO L729 BuchiCegarLoop]: Abstraction has 111 states and 161 transitions. [2019-01-14 02:15:06,000 INFO L609 BuchiCegarLoop]: Abstraction has 111 states and 161 transitions. [2019-01-14 02:15:06,000 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:15:06,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 161 transitions. [2019-01-14 02:15:06,003 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 02:15:06,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:15:06,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:15:06,006 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:15:06,006 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:15:06,006 INFO L794 eck$LassoCheckResult]: Stem: 1455#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; 1456#L25 call main_#t~ret6 := rec2(main_~x~0);< 1463#rec2ENTRY ~j := #in~j; 1485#L18 assume !(~j <= 0); 1465#L20 call #t~ret3 := rec1(~j);< 1478#rec1ENTRY ~i := #in~i; 1475#L12 assume !(~i <= 0); 1425#L14 call #t~ret0 := rec1(~i - 2);< 1472#rec1ENTRY ~i := #in~i; 1470#L12 assume !(~i <= 0); 1423#L14 call #t~ret0 := rec1(~i - 2);< 1469#rec1ENTRY ~i := #in~i; 1471#L12 assume ~i <= 0;#res := 0; 1489#rec1FINAL assume true; 1480#rec1EXIT >#27#return; 1432#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1433#rec1ENTRY ~i := #in~i; 1492#L12 assume ~i <= 0;#res := 0; 1491#rec1FINAL assume true; 1490#rec1EXIT >#29#return; 1412#L14-2 call #t~ret2 := rec1(#t~ret1);< 1411#rec1ENTRY ~i := #in~i; 1413#L12 assume ~i <= 0;#res := 0; 1449#rec1FINAL assume true; 1451#rec1EXIT >#31#return; 1438#L14-3 #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret1;havoc #t~ret0; 1418#rec1FINAL assume true; 1428#rec1EXIT >#27#return; 1427#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1458#rec1ENTRY [2019-01-14 02:15:06,006 INFO L796 eck$LassoCheckResult]: Loop: 1458#rec1ENTRY ~i := #in~i; 1488#L12 assume !(~i <= 0); 1419#L14 call #t~ret0 := rec1(~i - 2);< 1458#rec1ENTRY [2019-01-14 02:15:06,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:06,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1733863270, now seen corresponding path program 1 times [2019-01-14 02:15:06,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:06,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:06,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:06,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:15:06,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:06,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:06,032 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 3 times [2019-01-14 02:15:06,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:06,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:06,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:06,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:15:06,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:06,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:06,041 INFO L82 PathProgramCache]: Analyzing trace with hash -2050992272, now seen corresponding path program 2 times [2019-01-14 02:15:06,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:06,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:06,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:06,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:15:06,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-14 02:15:06,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:15:06,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:15:06,171 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:15:06,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:15:06,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:15:06,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-14 02:15:06,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:15:06,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 02:15:06,295 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:15:06,295 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:15:06,295 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:15:06,295 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:15:06,296 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:15:06,296 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:06,296 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:15:06,296 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:15:06,296 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2019-01-14 02:15:06,298 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:15:06,298 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:15:06,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,360 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:15:06,360 INFO L412 LassoAnalysis]: Checking for nontermination... 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-14 02:15:06,365 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:06,365 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:06,367 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:06,368 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 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:06,390 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:06,390 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:06,393 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:06,393 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 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-14 02:15:06,421 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:06,421 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:06,429 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:06,430 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-14 02:15:06,451 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:06,451 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-14 02:15:06,473 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:15:06,473 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:06,494 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:15:06,496 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:15:06,496 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:15:06,496 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:15:06,496 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:15:06,496 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:15:06,496 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:06,497 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:15:06,497 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:15:06,497 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2019-01-14 02:15:06,497 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:15:06,497 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:15:06,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:06,594 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:15:06,594 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:15:06,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:06,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:06,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:06,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:06,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:06,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:06,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:06,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:06,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:06,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:06,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:06,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:06,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:06,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:06,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:06,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:06,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:06,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:06,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:06,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:06,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:06,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:06,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:06,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:06,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:06,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:06,608 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:15:06,609 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-14 02:15:06,609 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:15:06,610 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:15:06,610 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:15:06,610 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:15:06,610 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-01-14 02:15:06,610 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:15:06,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:06,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:06,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:15:06,887 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-14 02:15:06,887 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56 Second operand 5 states. [2019-01-14 02:15:06,950 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 128 states and 179 transitions. Complement of second has 7 states. [2019-01-14 02:15:06,953 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-14 02:15:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:15:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-14 02:15:06,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 29 letters. Loop has 3 letters. [2019-01-14 02:15:06,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:06,954 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:15:06,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:07,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:07,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:07,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:15:07,457 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-14 02:15:07,457 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56 Second operand 5 states. [2019-01-14 02:15:07,583 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 128 states and 179 transitions. Complement of second has 7 states. [2019-01-14 02:15:07,587 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-14 02:15:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:15:07,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-14 02:15:07,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 29 letters. Loop has 3 letters. [2019-01-14 02:15:07,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:07,588 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:15:07,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:07,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:07,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:15:07,817 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-14 02:15:07,817 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56 Second operand 5 states. [2019-01-14 02:15:07,934 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 156 states and 218 transitions. Complement of second has 13 states. [2019-01-14 02:15:07,939 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-14 02:15:07,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:15:07,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-01-14 02:15:07,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 29 letters. Loop has 3 letters. [2019-01-14 02:15:07,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:07,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 32 letters. Loop has 3 letters. [2019-01-14 02:15:07,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:07,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 29 letters. Loop has 6 letters. [2019-01-14 02:15:07,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:07,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 218 transitions. [2019-01-14 02:15:07,944 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2019-01-14 02:15:07,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 138 states and 200 transitions. [2019-01-14 02:15:07,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-01-14 02:15:07,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2019-01-14 02:15:07,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 200 transitions. [2019-01-14 02:15:07,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:15:07,950 INFO L706 BuchiCegarLoop]: Abstraction has 138 states and 200 transitions. [2019-01-14 02:15:07,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 200 transitions. [2019-01-14 02:15:07,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2019-01-14 02:15:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-14 02:15:07,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 169 transitions. [2019-01-14 02:15:07,961 INFO L729 BuchiCegarLoop]: Abstraction has 119 states and 169 transitions. [2019-01-14 02:15:07,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:15:07,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:15:07,962 INFO L87 Difference]: Start difference. First operand 119 states and 169 transitions. Second operand 8 states. [2019-01-14 02:15:08,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:15:08,058 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2019-01-14 02:15:08,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 02:15:08,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 115 transitions. [2019-01-14 02:15:08,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:15:08,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 62 states and 74 transitions. [2019-01-14 02:15:08,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:15:08,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:15:08,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 74 transitions. [2019-01-14 02:15:08,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:15:08,076 INFO L706 BuchiCegarLoop]: Abstraction has 62 states and 74 transitions. [2019-01-14 02:15:08,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 74 transitions. [2019-01-14 02:15:08,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2019-01-14 02:15:08,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 02:15:08,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2019-01-14 02:15:08,099 INFO L729 BuchiCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-01-14 02:15:08,099 INFO L609 BuchiCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-01-14 02:15:08,099 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:15:08,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 64 transitions. [2019-01-14 02:15:08,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:15:08,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:15:08,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:15:08,103 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:15:08,106 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:15:08,107 INFO L794 eck$LassoCheckResult]: Stem: 2631#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; 2602#L25 call main_#t~ret6 := rec2(main_~x~0);< 2601#rec2ENTRY ~j := #in~j; 2603#L18 assume !(~j <= 0); 2633#L20 call #t~ret3 := rec1(~j);< 2651#rec1ENTRY ~i := #in~i; 2649#L12 assume !(~i <= 0); 2621#L14 call #t~ret0 := rec1(~i - 2);< 2647#rec1ENTRY ~i := #in~i; 2650#L12 assume ~i <= 0;#res := 0; 2648#rec1FINAL assume true; 2629#rec1EXIT >#27#return; 2630#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 2622#rec1ENTRY ~i := #in~i; 2645#L12 assume ~i <= 0;#res := 0; 2643#rec1FINAL assume true; 2639#rec1EXIT >#29#return; 2638#L14-2 call #t~ret2 := rec1(#t~ret1);< 2628#rec1ENTRY ~i := #in~i; 2641#L12 assume ~i <= 0;#res := 0; 2640#rec1FINAL assume true; 2637#rec1EXIT >#31#return; 2636#L14-3 #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret1;havoc #t~ret0; 2635#rec1FINAL assume true; 2634#rec1EXIT >#33#return; 2605#L20-1 call #t~ret4 := rec2(#t~ret3 - 1);< 2604#rec2ENTRY ~j := #in~j; 2607#L18 assume !(~j <= 0); 2611#L20 call #t~ret3 := rec1(~j);< 2608#rec1ENTRY [2019-01-14 02:15:08,107 INFO L796 eck$LassoCheckResult]: Loop: 2608#rec1ENTRY ~i := #in~i; 2610#L12 assume !(~i <= 0); 2609#L14 call #t~ret0 := rec1(~i - 2);< 2608#rec1ENTRY [2019-01-14 02:15:08,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:08,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1852176490, now seen corresponding path program 2 times [2019-01-14 02:15:08,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:08,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:08,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:08,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:15:08,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-14 02:15:08,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:15:08,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:15:08,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:15:08,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:15:08,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:15:08,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:08,367 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-14 02:15:08,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:15:08,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 02:15:08,393 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:15:08,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:08,393 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 4 times [2019-01-14 02:15:08,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:08,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:08,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:08,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:15:08,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:08,493 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:15:08,493 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:15:08,493 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:15:08,493 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:15:08,494 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:15:08,494 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:08,494 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:15:08,494 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:15:08,494 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2019-01-14 02:15:08,494 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:15:08,494 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:15:08,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:08,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:08,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:08,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:08,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:08,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:08,672 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:15:08,673 INFO L412 LassoAnalysis]: Checking for nontermination... 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-14 02:15:08,677 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:08,677 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:08,681 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:08,681 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 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:08,702 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:08,702 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:08,705 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:08,706 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 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-14 02:15:08,726 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:08,726 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:08,728 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:08,729 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 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-14 02:15:08,750 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:08,750 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:08,753 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:15:08,753 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 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-14 02:15:08,773 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:15:08,773 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-14 02:15:08,795 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:15:08,795 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:15:08,816 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:15:08,817 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:15:08,818 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:15:08,818 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:15:08,818 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:15:08,818 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:15:08,818 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:08,818 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:15:08,818 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:15:08,818 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2019-01-14 02:15:08,818 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:15:08,818 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:15:08,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:08,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:08,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:08,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:08,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:08,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:08,893 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:15:08,893 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:15:08,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:08,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:08,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:08,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:08,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:08,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:08,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:08,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:08,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:08,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:08,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:08,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:08,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:08,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:08,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:08,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:08,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:08,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:08,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:08,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:08,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:08,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:08,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:08,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:08,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:08,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:08,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:08,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:08,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:08,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:08,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:08,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:08,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:08,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:08,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:08,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:08,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:08,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:08,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:08,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:08,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:08,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:08,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:08,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:08,914 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:15:08,915 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-14 02:15:08,915 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:15:08,916 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:15:08,916 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:15:08,916 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:15:08,916 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-01-14 02:15:08,916 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:15:08,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:09,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:09,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:09,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:15:09,189 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-14 02:15:09,189 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-01-14 02:15:09,259 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 63 states and 75 transitions. Complement of second has 13 states. [2019-01-14 02:15:09,261 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-14 02:15:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:15:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-01-14 02:15:09,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 29 letters. Loop has 3 letters. [2019-01-14 02:15:09,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:09,262 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:15:09,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:09,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:09,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:15:09,410 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-14 02:15:09,410 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-01-14 02:15:09,507 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 63 states and 75 transitions. Complement of second has 13 states. [2019-01-14 02:15:09,510 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-14 02:15:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:15:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-01-14 02:15:09,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 29 letters. Loop has 3 letters. [2019-01-14 02:15:09,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:09,511 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:15:09,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:09,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:09,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:15:09,629 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-14 02:15:09,629 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-01-14 02:15:09,720 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 77 states and 89 transitions. Complement of second has 13 states. [2019-01-14 02:15:09,723 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-14 02:15:09,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:15:09,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-01-14 02:15:09,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 29 letters. Loop has 3 letters. [2019-01-14 02:15:09,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:09,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 32 letters. Loop has 3 letters. [2019-01-14 02:15:09,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:09,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 29 letters. Loop has 6 letters. [2019-01-14 02:15:09,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:09,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 89 transitions. [2019-01-14 02:15:09,731 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:15:09,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2019-01-14 02:15:09,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:15:09,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:15:09,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:15:09,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:15:09,733 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:15:09,733 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:15:09,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:15:09,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:15:09,734 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 8 states. [2019-01-14 02:15:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:15:09,734 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 02:15:09,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:15:09,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 02:15:09,735 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:15:09,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 02:15:09,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:15:09,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:15:09,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:15:09,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:15:09,738 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:15:09,739 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:15:09,739 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:15:09,739 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:15:09,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:15:09,739 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:15:09,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:15:09,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:15:09 BoogieIcfgContainer [2019-01-14 02:15:09,751 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:15:09,751 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:15:09,751 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:15:09,751 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:15:09,752 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:14:59" (3/4) ... [2019-01-14 02:15:09,755 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:15:09,756 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:15:09,756 INFO L168 Benchmark]: Toolchain (without parser) took 10818.83 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.4 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -282.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:15:09,758 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:15:09,759 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.85 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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-14 02:15:09,760 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.76 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-14 02:15:09,760 INFO L168 Benchmark]: Boogie Preprocessor took 26.28 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-14 02:15:09,762 INFO L168 Benchmark]: RCFGBuilder took 363.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -149.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:15:09,763 INFO L168 Benchmark]: BuchiAutomizer took 10111.41 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -143.8 MB). Peak memory consumption was 41.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:15:09,763 INFO L168 Benchmark]: Witness Printer took 4.55 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:15:09,769 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.85 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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 45.76 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 26.28 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 363.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -149.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10111.41 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -143.8 MB). Peak memory consumption was 41.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.55 ms. Allocated memory is still 1.3 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 10 terminating modules (5 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(j) and consists of 10 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 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 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.0s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 4.9s. Construction of modules took 0.7s. Büchi inclusion checks took 3.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 89 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 111 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 22/24 HoareTripleCheckerStatistics: 188 SDtfs, 186 SDslu, 311 SDs, 0 SdLazy, 306 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq155 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...