./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted/NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted/NestedRecursion_2b_true-no-overflow_false-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 1b7166d94206693c3f254a3c1de8d5825f8510fb ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:31:38,340 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:31:38,342 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:31:38,355 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:31:38,356 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:31:38,358 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:31:38,359 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:31:38,361 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:31:38,364 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:31:38,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:31:38,369 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:31:38,371 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:31:38,372 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:31:38,375 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:31:38,377 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:31:38,378 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:31:38,380 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:31:38,382 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:31:38,384 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:31:38,385 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:31:38,386 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:31:38,388 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:31:38,391 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:31:38,391 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:31:38,391 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:31:38,393 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:31:38,394 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:31:38,395 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:31:38,396 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:31:38,397 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:31:38,397 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:31:38,398 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:31:38,398 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:31:38,399 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:31:38,400 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:31:38,401 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:31:38,401 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:31:38,431 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:31:38,433 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:31:38,434 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:31:38,438 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:31:38,438 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:31:38,438 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:31:38,439 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:31:38,439 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:31:38,439 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:31:38,439 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:31:38,439 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:31:38,439 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:31:38,441 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:31:38,442 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:31:38,442 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:31:38,442 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:31:38,442 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:31:38,443 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:31:38,443 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:31:38,443 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:31:38,443 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:31:38,443 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:31:38,444 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:31:38,444 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:31:38,444 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:31:38,444 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:31:38,444 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:31:38,444 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:31:38,450 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:31:38,451 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 -> 1b7166d94206693c3f254a3c1de8d5825f8510fb [2019-01-01 21:31:38,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:31:38,522 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:31:38,526 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:31:38,528 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:31:38,529 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:31:38,530 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c [2019-01-01 21:31:38,596 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27c31c5c2/fd961295948b4bdca6305004116d0f77/FLAGb8fc692cf [2019-01-01 21:31:39,039 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:31:39,040 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c [2019-01-01 21:31:39,046 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27c31c5c2/fd961295948b4bdca6305004116d0f77/FLAGb8fc692cf [2019-01-01 21:31:39,445 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27c31c5c2/fd961295948b4bdca6305004116d0f77 [2019-01-01 21:31:39,449 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:31:39,450 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:31:39,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:31:39,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:31:39,456 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:31:39,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c03e545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39, skipping insertion in model container [2019-01-01 21:31:39,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:31:39,490 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:31:39,664 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:31:39,672 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:31:39,691 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:31:39,705 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:31:39,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39 WrapperNode [2019-01-01 21:31:39,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:31:39,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:31:39,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:31:39,707 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:31:39,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:31:39,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:31:39,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:31:39,746 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:31:39,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:31:39,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:31:39,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:31:39,768 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:31:39,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:39,892 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-01 21:31:39,892 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-01 21:31:39,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:31:39,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:31:40,061 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:31:40,061 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 21:31:40,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:31:40 BoogieIcfgContainer [2019-01-01 21:31:40,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:31:40,063 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:31:40,063 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:31:40,067 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:31:40,068 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:31:40,068 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:31:39" (1/3) ... [2019-01-01 21:31:40,070 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2716caa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:31:40, skipping insertion in model container [2019-01-01 21:31:40,070 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:31:40,070 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (2/3) ... [2019-01-01 21:31:40,071 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2716caa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:31:40, skipping insertion in model container [2019-01-01 21:31:40,071 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:31:40,071 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:31:40" (3/3) ... [2019-01-01 21:31:40,074 INFO L375 chiAutomizerObserver]: Analyzing ICFG NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c [2019-01-01 21:31:40,152 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:31:40,152 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:31:40,153 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:31:40,153 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:31:40,153 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:31:40,153 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:31:40,153 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:31:40,153 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:31:40,153 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:31:40,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-01 21:31:40,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:31:40,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:40,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:40,226 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:31:40,226 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:31:40,226 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:31:40,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-01 21:31:40,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:31:40,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:40,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:40,232 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:31:40,232 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:31:40,242 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 7#L20true assume !(main_~x~0 < 0); 9#L21true call main_#t~ret3 := g(main_~x~0);< 11#gENTRYtrue [2019-01-01 21:31:40,244 INFO L796 eck$LassoCheckResult]: Loop: 11#gENTRYtrue ~x := #in~x; 3#L12true assume !(0 == ~x); 13#L15true call #t~ret0 := g(~x - 1);< 11#gENTRYtrue [2019-01-01 21:31:40,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:40,251 INFO L82 PathProgramCache]: Analyzing trace with hash 39891, now seen corresponding path program 1 times [2019-01-01 21:31:40,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:40,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:40,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:40,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:40,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:40,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:40,384 INFO L82 PathProgramCache]: Analyzing trace with hash 29936, now seen corresponding path program 1 times [2019-01-01 21:31:40,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:40,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:40,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:40,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:40,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:40,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:40,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1188392926, now seen corresponding path program 1 times [2019-01-01 21:31:40,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:40,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:40,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:40,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:40,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:40,645 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 21:31:40,727 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:31:40,729 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:31:40,729 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:31:40,729 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:31:40,729 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:31:40,729 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:40,729 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:31:40,730 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:31:40,732 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c_Iteration1_Loop [2019-01-01 21:31:40,732 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:31:40,733 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:31:40,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:40,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:40,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:40,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:40,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:41,074 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 21:31:41,083 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:31:41,084 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:41,096 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:41,096 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:31:41,119 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:31:41,119 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_~x=0} Honda state: {g_~x=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-01 21:31:41,155 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:41,155 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-01 21:31:41,162 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:31:41,162 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:41,184 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:41,184 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:31:41,188 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:31:41,188 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:41,210 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:41,210 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:31:41,218 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:31:41,218 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:41,251 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:41,252 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:41,277 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:31:41,277 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:31:41,303 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:31:41,304 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#in~x=-1} Honda state: {g_#in~x=-1} Generalized eigenvectors: [{g_#in~x=0}, {g_#in~x=-1}, {g_#in~x=0}] Lambdas: [8, 1, 8] Nus: [0, 0] [2019-01-01 21:31:41,418 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:31:41,418 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:31:41,418 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:31:41,418 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:31:41,418 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:31:41,419 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:41,419 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:31:41,419 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:31:41,419 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c_Iteration1_Lasso [2019-01-01 21:31:41,419 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:31:41,419 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:31:41,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:41,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:41,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:41,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:41,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:41,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:41,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:41,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:41,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:41,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:41,693 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 21:31:41,971 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 21:31:42,022 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:31:42,022 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:42,026 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:42,026 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:31:42,030 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:31:42,030 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:42,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:42,053 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:31:42,057 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:31:42,057 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:42,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:42,079 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:31:42,085 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:31:42,085 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:42,107 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:42,107 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:31:42,110 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:31:42,110 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:42,132 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:42,132 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:31:42,135 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:31:42,135 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_#t~ret4=0} Honda state: {ULTIMATE.start_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:42,155 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:42,155 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:31:42,159 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:31:42,159 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:42,179 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:42,180 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:42,207 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:31:42,207 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:31:42,242 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:31:42,243 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:31:42,244 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:31:42,244 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:31:42,244 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:31:42,244 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:31:42,244 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:42,244 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:31:42,244 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:31:42,245 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c_Iteration1_Lasso [2019-01-01 21:31:42,245 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:31:42,245 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:31:42,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:42,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:42,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:42,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:42,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:42,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:42,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:42,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:42,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:42,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:42,786 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 21:31:42,792 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:31:42,800 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:31:42,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:31:42,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:42,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:42,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:42,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:42,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:42,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:42,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:42,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:42,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:31:42,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:42,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:42,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:42,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:42,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:42,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:42,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:42,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:42,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:31:42,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:42,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:42,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:42,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:42,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:42,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:42,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:42,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:42,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:31:42,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:42,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:42,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:42,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:42,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:42,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:42,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:42,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:42,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:31:42,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:42,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:42,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:42,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:42,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:42,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:42,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:42,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:42,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:31:42,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:42,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:42,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:42,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:42,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:42,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:42,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:42,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:42,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:31:42,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:42,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:42,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:42,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:42,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:42,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:42,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:42,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:42,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:31:42,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:42,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:42,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:42,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:42,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:42,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:42,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:42,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:42,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:31:42,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:42,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:42,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:42,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:42,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:42,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:42,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:42,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:42,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:31:42,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:42,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:42,887 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:31:42,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:42,906 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-01 21:31:42,906 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:31:43,038 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:31:43,103 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-01 21:31:43,103 INFO L444 ModelExtractionUtils]: 4 out of 11 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 21:31:43,108 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:31:43,118 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-01-01 21:31:43,118 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:31:43,119 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(g_#in~x) = 1*g_#in~x Supporting invariants [1*g_#in~x >= 0] [2019-01-01 21:31:43,152 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:31:43,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:43,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:31:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:43,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:31:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:43,437 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 21:31:43,439 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 5 states. [2019-01-01 21:31:43,934 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 5 states. Result 35 states and 42 transitions. Complement of second has 13 states. [2019-01-01 21:31:43,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:31:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:31:43,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-01 21:31:43,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-01 21:31:43,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:31:43,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 21:31:43,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:31:43,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-01 21:31:43,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:31:43,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2019-01-01 21:31:43,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:31:43,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 19 states and 25 transitions. [2019-01-01 21:31:43,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 21:31:43,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 21:31:43,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2019-01-01 21:31:43,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:31:43,960 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-01 21:31:43,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2019-01-01 21:31:43,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-01-01 21:31:43,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 21:31:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-01-01 21:31:43,992 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-01 21:31:43,992 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-01 21:31:43,992 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:31:43,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-01-01 21:31:43,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:31:43,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:43,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:43,995 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:31:43,995 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:31:43,996 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 121#L20 assume !(main_~x~0 < 0); 118#L21 call main_#t~ret3 := g(main_~x~0);< 119#gENTRY ~x := #in~x; 117#L12 assume !(0 == ~x); 115#L15 call #t~ret0 := g(~x - 1);< 122#gENTRY ~x := #in~x; 114#L12 assume 0 == ~x;#res := 1; 116#gFINAL assume true; 123#gEXIT >#22#return; 125#L15-1 [2019-01-01 21:31:43,996 INFO L796 eck$LassoCheckResult]: Loop: 125#L15-1 call #t~ret1 := g(1 + #t~ret0);< 126#gENTRY ~x := #in~x; 129#L12 assume !(0 == ~x); 124#L15 call #t~ret0 := g(~x - 1);< 126#gENTRY ~x := #in~x; 129#L12 assume 0 == ~x;#res := 1; 128#gFINAL assume true; 130#gEXIT >#22#return; 125#L15-1 [2019-01-01 21:31:43,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:43,996 INFO L82 PathProgramCache]: Analyzing trace with hash -54633169, now seen corresponding path program 1 times [2019-01-01 21:31:43,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:43,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:43,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:43,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:43,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:44,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:44,011 INFO L82 PathProgramCache]: Analyzing trace with hash -243608724, now seen corresponding path program 1 times [2019-01-01 21:31:44,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:44,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:44,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:44,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:44,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:44,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:44,023 INFO L82 PathProgramCache]: Analyzing trace with hash -791141734, now seen corresponding path program 1 times [2019-01-01 21:31:44,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:44,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:44,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:44,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:44,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:31:44,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:31:44,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:31:44,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:44,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:31:44,228 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:31:44,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:31:44,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 21:31:44,475 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:31:44,475 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:31:44,475 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:31:44,475 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:31:44,476 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:31:44,476 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:44,476 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:31:44,476 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:31:44,476 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-01 21:31:44,476 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:31:44,476 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:31:44,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:44,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:44,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-01 21:31:44,594 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:31:44,595 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:44,599 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:44,599 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-01 21:31:44,625 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:31:44,625 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:31:45,940 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:31:45,942 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:31:45,942 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:31:45,943 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:31:45,943 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:31:45,943 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:31:45,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:45,943 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:31:45,943 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:31:45,943 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-01 21:31:45,943 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:31:45,944 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:31:45,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:45,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:45,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:46,015 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:31:46,016 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:31:46,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:31:46,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:46,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:46,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:46,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:46,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:46,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:46,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:46,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:46,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:31:46,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:46,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:46,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:46,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:46,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:46,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:46,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:46,031 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:31:46,034 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:31:46,034 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:31:46,035 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:31:46,035 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:31:46,035 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:31:46,035 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(g_#t~ret0) = -2*g_#t~ret0 + 1 Supporting invariants [] [2019-01-01 21:31:46,036 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:31:46,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:46,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:31:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:46,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:31:46,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:46,470 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-01-01 21:31:46,470 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 8 states. [2019-01-01 21:31:47,014 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 8 states. Result 82 states and 120 transitions. Complement of second has 31 states. [2019-01-01 21:31:47,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2019-01-01 21:31:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:31:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2019-01-01 21:31:47,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 10 letters. Loop has 8 letters. [2019-01-01 21:31:47,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:31:47,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 18 letters. Loop has 8 letters. [2019-01-01 21:31:47,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:31:47,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 10 letters. Loop has 16 letters. [2019-01-01 21:31:47,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:31:47,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 120 transitions. [2019-01-01 21:31:47,033 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 21:31:47,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 58 states and 81 transitions. [2019-01-01 21:31:47,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-01-01 21:31:47,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-01-01 21:31:47,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 81 transitions. [2019-01-01 21:31:47,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:31:47,039 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 81 transitions. [2019-01-01 21:31:47,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 81 transitions. [2019-01-01 21:31:47,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2019-01-01 21:31:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-01 21:31:47,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2019-01-01 21:31:47,052 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2019-01-01 21:31:47,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 21:31:47,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-01 21:31:47,057 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand 8 states. [2019-01-01 21:31:47,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:31:47,195 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2019-01-01 21:31:47,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 21:31:47,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 44 transitions. [2019-01-01 21:31:47,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:31:47,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 30 states and 34 transitions. [2019-01-01 21:31:47,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:31:47,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 21:31:47,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2019-01-01 21:31:47,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:31:47,200 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-01-01 21:31:47,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2019-01-01 21:31:47,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-01-01 21:31:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-01 21:31:47,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-01-01 21:31:47,204 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-01-01 21:31:47,204 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-01-01 21:31:47,204 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:31:47,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2019-01-01 21:31:47,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:31:47,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:47,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:47,206 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:31:47,206 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:31:47,206 INFO L794 eck$LassoCheckResult]: Stem: 492#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 493#L20 assume !(main_~x~0 < 0); 490#L21 call main_#t~ret3 := g(main_~x~0);< 491#gENTRY ~x := #in~x; 488#L12 assume !(0 == ~x); 489#L15 call #t~ret0 := g(~x - 1);< 497#gENTRY ~x := #in~x; 498#L12 assume 0 == ~x;#res := 1; 506#gFINAL assume true; 504#gEXIT >#22#return; 486#L15-1 call #t~ret1 := g(1 + #t~ret0);< 509#gENTRY ~x := #in~x; 485#L12 assume !(0 == ~x); 487#L15 call #t~ret0 := g(~x - 1);< 503#gENTRY ~x := #in~x; 507#L12 assume !(0 == ~x); 500#L15 [2019-01-01 21:31:47,206 INFO L796 eck$LassoCheckResult]: Loop: 500#L15 call #t~ret0 := g(~x - 1);< 505#gENTRY ~x := #in~x; 508#L12 assume !(0 == ~x); 500#L15 [2019-01-01 21:31:47,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:47,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2001409165, now seen corresponding path program 2 times [2019-01-01 21:31:47,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:47,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:47,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:47,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:47,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:47,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:47,221 INFO L82 PathProgramCache]: Analyzing trace with hash 49976, now seen corresponding path program 2 times [2019-01-01 21:31:47,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:47,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:47,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:47,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:47,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:47,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:47,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1244451628, now seen corresponding path program 3 times [2019-01-01 21:31:47,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:47,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:47,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:47,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:47,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:31:47,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:31:47,414 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:31:47,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:31:47,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-01 21:31:47,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:31:47,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:31:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:31:47,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:31:47,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-01 21:31:47,561 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:31:47,561 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:31:47,561 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:31:47,561 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:31:47,562 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:31:47,562 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:47,562 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:31:47,562 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:31:47,562 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-01 21:31:47,562 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:31:47,563 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:31:47,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:47,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:47,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:47,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:47,627 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:31:47,627 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:47,638 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:47,638 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:47,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:31:47,667 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:31:47,848 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:31:47,848 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#in~x=-8, g_~x=-8} Honda state: {g_#in~x=-8, g_~x=-8} Generalized eigenvectors: [{g_#in~x=0, g_~x=0}, {g_#in~x=-1, g_~x=-1}, {g_#in~x=0, g_~x=0}] Lambdas: [8, 1, 3] Nus: [0, 0] 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-01 21:31:47,869 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:47,869 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:31:47,878 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:31:47,879 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=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-01 21:31:47,899 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:47,900 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:31:47,902 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:31:47,902 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=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) [2019-01-01 21:31:47,929 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:31:47,929 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:47,940 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:31:47,941 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-01-01 21:31:47,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 21:31:47,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-01 21:31:47,959 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. cyclomatic complexity: 4 Second operand 10 states. [2019-01-01 21:31:48,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:31:48,208 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-01 21:31:48,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 21:31:48,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2019-01-01 21:31:48,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:31:48,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 28 transitions. [2019-01-01 21:31:48,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-01 21:31:48,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-01 21:31:48,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2019-01-01 21:31:48,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:31:48,213 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-01 21:31:48,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2019-01-01 21:31:48,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-01-01 21:31:48,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 21:31:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-01 21:31:48,215 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-01 21:31:48,215 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-01 21:31:48,215 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:31:48,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2019-01-01 21:31:48,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:31:48,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:48,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:48,217 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:31:48,217 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1] [2019-01-01 21:31:48,217 INFO L794 eck$LassoCheckResult]: Stem: 625#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 626#L20 assume !(main_~x~0 < 0); 618#L21 call main_#t~ret3 := g(main_~x~0);< 619#gENTRY ~x := #in~x; 623#L12 assume !(0 == ~x); 624#L15 call #t~ret0 := g(~x - 1);< 628#gENTRY ~x := #in~x; 629#L12 assume 0 == ~x;#res := 1; 636#gFINAL assume true; 634#gEXIT >#22#return; 621#L15-1 [2019-01-01 21:31:48,217 INFO L796 eck$LassoCheckResult]: Loop: 621#L15-1 call #t~ret1 := g(1 + #t~ret0);< 627#gENTRY ~x := #in~x; 620#L12 assume !(0 == ~x); 622#L15 call #t~ret0 := g(~x - 1);< 633#gENTRY ~x := #in~x; 637#L12 assume !(0 == ~x); 631#L15 call #t~ret0 := g(~x - 1);< 635#gENTRY ~x := #in~x; 638#L12 assume 0 == ~x;#res := 1; 630#gFINAL assume true; 632#gEXIT >#22#return; 621#L15-1 [2019-01-01 21:31:48,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:48,218 INFO L82 PathProgramCache]: Analyzing trace with hash -54633169, now seen corresponding path program 2 times [2019-01-01 21:31:48,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:48,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:48,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:48,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:48,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:48,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:48,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1187216231, now seen corresponding path program 2 times [2019-01-01 21:31:48,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:48,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:48,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:48,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:48,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:48,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:48,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1917105529, now seen corresponding path program 4 times [2019-01-01 21:31:48,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:48,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:48,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:48,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:48,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:48,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:31:48 BoogieIcfgContainer [2019-01-01 21:31:48,607 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:31:48,608 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:31:48,608 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:31:48,608 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:31:48,609 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:31:40" (3/4) ... [2019-01-01 21:31:48,613 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 21:31:48,669 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 21:31:48,669 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:31:48,670 INFO L168 Benchmark]: Toolchain (without parser) took 9220.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -108.5 MB). Peak memory consumption was 94.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:31:48,671 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:31:48,672 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.10 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:31:48,673 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.65 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:31:48,673 INFO L168 Benchmark]: Boogie Preprocessor took 21.65 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:31:48,674 INFO L168 Benchmark]: RCFGBuilder took 293.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:31:48,674 INFO L168 Benchmark]: BuchiAutomizer took 8544.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 61.1 MB). Peak memory consumption was 133.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:31:48,675 INFO L168 Benchmark]: Witness Printer took 61.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:31:48,679 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 255.10 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.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 38.65 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.65 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 293.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8544.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 61.1 MB). Peak memory consumption was 133.9 MB. Max. memory is 11.5 GB. * Witness Printer took 61.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(x) and consists of 5 locations. One deterministic module has affine ranking function -2 * aux-g(x - 1)-aux + 1 and consists of 10 locations. 2 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.4s and 4 iterations. TraceHistogramMax:4. Analysis of lassos took 6.1s. Construction of modules took 0.4s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 46 SDtfs, 67 SDslu, 97 SDs, 0 SdLazy, 225 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT1 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq194 hnf92 smp100 dnf139 smp100 tf104 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 232ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.8s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 15]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@78c7c33f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7dcc4356=1, \result=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a089848=0, \old(x)=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d44488d=0, x=0, x=1, NULL=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 15]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L19] int x = __VERIFIER_nondet_int(); [L20] COND FALSE !(x < 0) [L21] CALL g(x) [L12] COND FALSE !(x == 0) [L15] CALL g(x - 1) [L12] COND TRUE x == 0 [L13] return 1; [L15] RET g(x - 1) Loop: [L15] CALL g(g(x - 1) + 1) [L12] COND FALSE !(x == 0) [L15] CALL g(x - 1) [L12] COND FALSE !(x == 0) [L15] CALL g(x - 1) [L12] COND TRUE x == 0 [L13] return 1; [L15] RET g(x - 1) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...