./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/MutualRecursion_1a.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 --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 727b654585befeb7272249307a5de272b17c4e2d2d1afa67fd11f4eb185d7508 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:13:01,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:13:01,799 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-19 14:13:01,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:13:01,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:13:01,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:13:01,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:13:01,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:13:01,836 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:13:01,837 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:13:01,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:13:01,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:13:01,837 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:13:01,838 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:13:01,849 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:13:01,849 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:13:01,849 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:13:01,849 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:13:01,850 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:13:01,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:13:01,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:13:01,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:13:01,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:13:01,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:13:01,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:13:01,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:13:01,851 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:13:01,852 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:13:01,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:13:01,852 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:13:01,852 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:13:01,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:13:01,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:13:01,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:13:01,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:13:01,854 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:13:01,854 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 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 -> 727b654585befeb7272249307a5de272b17c4e2d2d1afa67fd11f4eb185d7508 [2024-11-19 14:13:02,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:13:02,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:13:02,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:13:02,235 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:13:02,240 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:13:02,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c [2024-11-19 14:13:03,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:13:03,760 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:13:03,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c [2024-11-19 14:13:03,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2725cb36/338caa03205b44bd902089c63f037c33/FLAGef2e3f899 [2024-11-19 14:13:04,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2725cb36/338caa03205b44bd902089c63f037c33 [2024-11-19 14:13:04,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:13:04,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:13:04,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:13:04,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:13:04,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:13:04,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:13:04" (1/1) ... [2024-11-19 14:13:04,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a2f7f0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:04, skipping insertion in model container [2024-11-19 14:13:04,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:13:04" (1/1) ... [2024-11-19 14:13:04,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:13:04,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:13:04,304 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:13:04,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:13:04,327 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:13:04,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:04 WrapperNode [2024-11-19 14:13:04,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:13:04,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:13:04,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:13:04,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:13:04,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:04" (1/1) ... [2024-11-19 14:13:04,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:04" (1/1) ... [2024-11-19 14:13:04,346 INFO L138 Inliner]: procedures = 6, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 7 [2024-11-19 14:13:04,346 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:13:04,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:13:04,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:13:04,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:13:04,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:04" (1/1) ... [2024-11-19 14:13:04,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:04" (1/1) ... [2024-11-19 14:13:04,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:04" (1/1) ... [2024-11-19 14:13:04,359 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 14:13:04,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:04" (1/1) ... [2024-11-19 14:13:04,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:04" (1/1) ... [2024-11-19 14:13:04,361 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:04" (1/1) ... [2024-11-19 14:13:04,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:04" (1/1) ... [2024-11-19 14:13:04,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:04" (1/1) ... [2024-11-19 14:13:04,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:04" (1/1) ... [2024-11-19 14:13:04,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:13:04,365 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:13:04,365 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:13:04,365 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:13:04,366 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:04" (1/1) ... [2024-11-19 14:13:04,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:04,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:04,394 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:04,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 14:13:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-19 14:13:04,428 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-19 14:13:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure g [2024-11-19 14:13:04,429 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2024-11-19 14:13:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:13:04,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:13:04,472 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:13:04,474 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:13:04,573 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-19 14:13:04,574 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:13:04,583 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:13:04,583 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 14:13:04,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:13:04 BoogieIcfgContainer [2024-11-19 14:13:04,584 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:13:04,584 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:13:04,585 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:13:04,587 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:13:04,588 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:13:04,588 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:13:04" (1/3) ... [2024-11-19 14:13:04,589 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@132aefea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:13:04, skipping insertion in model container [2024-11-19 14:13:04,589 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:13:04,589 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:13:04" (2/3) ... [2024-11-19 14:13:04,589 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@132aefea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:13:04, skipping insertion in model container [2024-11-19 14:13:04,589 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:13:04,589 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:13:04" (3/3) ... [2024-11-19 14:13:04,590 INFO L332 chiAutomizerObserver]: Analyzing ICFG MutualRecursion_1a.c [2024-11-19 14:13:04,631 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:13:04,631 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:13:04,631 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:13:04,632 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:13:04,632 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:13:04,632 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:13:04,632 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:13:04,632 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:13:04,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 14:13:04,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:13:04,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:13:04,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:13:04,655 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 14:13:04,655 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:13:04,655 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:13:04,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 14:13:04,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:13:04,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:13:04,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:13:04,657 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 14:13:04,657 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:13:04,663 INFO L745 eck$LassoCheckResult]: Stem: 18#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~x~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11#L26true call main_#t~ret5#1 := g(main_~x~0#1);< 19#$Ultimate##0true [2024-11-19 14:13:04,663 INFO L747 eck$LassoCheckResult]: Loop: 19#$Ultimate##0true ~x := #in~x; 5#L19true assume !(~x <= 0); 10#L20true call #t~ret2 := f(~x - 1);< 16#$Ultimate##0true ~x := #in~x; 15#L13true assume !(~x <= 0); 8#L14true call #t~ret0 := g(~x);< 19#$Ultimate##0true [2024-11-19 14:13:04,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:04,668 INFO L85 PathProgramCache]: Analyzing trace with hash 47743, now seen corresponding path program 1 times [2024-11-19 14:13:04,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:13:04,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639609099] [2024-11-19 14:13:04,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:13:04,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:13:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:04,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:13:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:04,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:13:04,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:04,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1158065693, now seen corresponding path program 1 times [2024-11-19 14:13:04,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:13:04,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092537114] [2024-11-19 14:13:04,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:13:04,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:13:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:04,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:13:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:04,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:13:04,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:04,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1788538341, now seen corresponding path program 1 times [2024-11-19 14:13:04,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:13:04,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67275437] [2024-11-19 14:13:04,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:13:04,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:13:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:04,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:13:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:04,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:13:04,893 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:13:04,894 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:13:04,895 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:13:04,895 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:13:04,895 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:13:04,895 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:04,895 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:13:04,895 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:13:04,895 INFO L132 ssoRankerPreferences]: Filename of dumped script: MutualRecursion_1a.c_Iteration1_Loop [2024-11-19 14:13:04,895 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:13:04,895 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:13:04,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:04,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:04,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:04,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:04,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:04,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:04,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:04,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:04,991 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:13:04,991 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:13:04,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:04,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:04,995 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:04,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-19 14:13:04,997 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:13:04,997 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:13:05,012 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:13:05,013 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f_#res=0} Honda state: {f_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:13:05,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-19 14:13:05,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:05,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:05,031 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:05,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-19 14:13:05,034 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:13:05,034 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:13:05,046 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:13:05,046 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret2=0} Honda state: {g_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:13:05,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-19 14:13:05,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:05,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:05,060 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:05,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-19 14:13:05,091 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:13:05,091 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:13:05,103 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:13:05,103 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret3=0} Honda state: {g_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:13:05,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-19 14:13:05,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:05,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:05,119 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:05,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 14:13:05,133 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:13:05,133 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:13:05,160 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:13:05,161 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:13:05,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 14:13:05,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:05,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:05,174 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:05,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-19 14:13:05,176 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:13:05,176 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:13:05,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-19 14:13:05,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:05,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:05,201 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:05,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-19 14:13:05,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:13:05,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:13:05,261 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:13:05,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-19 14:13:05,267 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:13:05,267 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:13:05,267 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:13:05,267 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:13:05,267 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:13:05,267 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:05,267 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:13:05,267 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:13:05,267 INFO L132 ssoRankerPreferences]: Filename of dumped script: MutualRecursion_1a.c_Iteration1_Loop [2024-11-19 14:13:05,267 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:13:05,267 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:13:05,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:05,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:05,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:05,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:05,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:05,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:05,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:05,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:13:05,331 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:13:05,335 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:13:05,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:05,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:05,337 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:05,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-19 14:13:05,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:13:05,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:13:05,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:13:05,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:13:05,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:13:05,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:13:05,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:13:05,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:13:05,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:13:05,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-19 14:13:05,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:05,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:05,373 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:05,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-19 14:13:05,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:13:05,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:13:05,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:13:05,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:13:05,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:13:05,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:13:05,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:13:05,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:13:05,387 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:13:05,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-19 14:13:05,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:05,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:05,400 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:05,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-19 14:13:05,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:13:05,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:13:05,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:13:05,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:13:05,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:13:05,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:13:05,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:13:05,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:13:05,415 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:13:05,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-19 14:13:05,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:05,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:05,428 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:05,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-19 14:13:05,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:13:05,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:13:05,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:13:05,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:13:05,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:13:05,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:13:05,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:13:05,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:13:05,446 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:13:05,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-19 14:13:05,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:05,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:05,459 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:05,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-19 14:13:05,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:13:05,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:13:05,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:13:05,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:13:05,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:13:05,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:13:05,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:13:05,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:13:05,473 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:13:05,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-19 14:13:05,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:05,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:05,487 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:05,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-19 14:13:05,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:13:05,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:13:05,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:13:05,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:13:05,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:13:05,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:13:05,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:13:05,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:13:05,504 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:13:05,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-19 14:13:05,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:05,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:05,520 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:05,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-19 14:13:05,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:13:05,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:13:05,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:13:05,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:13:05,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:13:05,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:13:05,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:13:05,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:13:05,535 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:13:05,537 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-19 14:13:05,538 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:13:05,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:13:05,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:13:05,540 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:13:05,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-19 14:13:05,542 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:13:05,542 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:13:05,542 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:13:05,543 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(g_#in~x) = 1*g_#in~x Supporting invariants [] [2024-11-19 14:13:05,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-19 14:13:05,556 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:13:05,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:13:05,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:13:05,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:13:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:13:05,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 14:13:05,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:13:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:13:05,707 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-11-19 14:13:05,710 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:13:05,855 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5). Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 63 states and 82 transitions. Complement of second has 28 states. [2024-11-19 14:13:05,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2024-11-19 14:13:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:13:05,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2024-11-19 14:13:05,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 3 letters. Loop has 6 letters. [2024-11-19 14:13:05,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:13:05,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 9 letters. Loop has 6 letters. [2024-11-19 14:13:05,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:13:05,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 3 letters. Loop has 12 letters. [2024-11-19 14:13:05,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:13:05,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 82 transitions. [2024-11-19 14:13:05,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:13:05,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 46 states and 60 transitions. [2024-11-19 14:13:05,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-11-19 14:13:05,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-19 14:13:05,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 60 transitions. [2024-11-19 14:13:05,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:13:05,886 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 60 transitions. [2024-11-19 14:13:05,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 60 transitions. [2024-11-19 14:13:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-11-19 14:13:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-19 14:13:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2024-11-19 14:13:05,909 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 57 transitions. [2024-11-19 14:13:05,909 INFO L425 stractBuchiCegarLoop]: Abstraction has 45 states and 57 transitions. [2024-11-19 14:13:05,909 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:13:05,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 57 transitions. [2024-11-19 14:13:05,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:13:05,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:13:05,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:13:05,912 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:13:05,912 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:13:05,912 INFO L745 eck$LassoCheckResult]: Stem: 201#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 194#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~x~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 192#L26 call main_#t~ret5#1 := g(main_~x~0#1);< 193#$Ultimate##0 ~x := #in~x; 202#L19 assume !(~x <= 0); 173#L20 call #t~ret2 := f(~x - 1);< 191#$Ultimate##0 ~x := #in~x; 204#L13 assume !(~x <= 0); 179#L14 call #t~ret0 := g(~x);< 189#$Ultimate##0 ~x := #in~x; 178#L19 assume ~x <= 0;#res := 0; 180#gFINAL assume true; 187#gEXIT >#27#return; 183#L14-1 [2024-11-19 14:13:05,912 INFO L747 eck$LassoCheckResult]: Loop: 183#L14-1 call #t~ret1 := g(1 + ~x);< 186#$Ultimate##0 ~x := #in~x; 208#L19 assume !(~x <= 0); 184#L20 call #t~ret2 := f(~x - 1);< 206#$Ultimate##0 ~x := #in~x; 205#L13 assume !(~x <= 0); 188#L14 call #t~ret0 := g(~x);< 186#$Ultimate##0 ~x := #in~x; 208#L19 assume ~x <= 0;#res := 0; 203#gFINAL assume true; 207#gEXIT >#27#return; 183#L14-1 [2024-11-19 14:13:05,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:05,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1510789928, now seen corresponding path program 1 times [2024-11-19 14:13:05,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:13:05,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836848230] [2024-11-19 14:13:05,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:13:05,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:13:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:13:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 14:13:05,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:13:05,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836848230] [2024-11-19 14:13:05,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836848230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:13:05,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:13:05,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:13:05,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234005398] [2024-11-19 14:13:05,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:13:05,977 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:13:05,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:05,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1553130012, now seen corresponding path program 1 times [2024-11-19 14:13:05,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:13:05,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93346795] [2024-11-19 14:13:05,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:13:05,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:13:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:13:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 14:13:06,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:13:06,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93346795] [2024-11-19 14:13:06,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93346795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:13:06,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:13:06,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:13:06,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611368132] [2024-11-19 14:13:06,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:13:06,020 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:13:06,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:13:06,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 14:13:06,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 14:13:06,022 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. cyclomatic complexity: 14 Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 14:13:06,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:13:06,063 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2024-11-19 14:13:06,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2024-11-19 14:13:06,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:13:06,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 45 states and 56 transitions. [2024-11-19 14:13:06,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-19 14:13:06,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-19 14:13:06,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 56 transitions. [2024-11-19 14:13:06,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:13:06,067 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 56 transitions. [2024-11-19 14:13:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 56 transitions. [2024-11-19 14:13:06,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-19 14:13:06,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 29 states have internal predecessors, (30), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-19 14:13:06,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2024-11-19 14:13:06,070 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 56 transitions. [2024-11-19 14:13:06,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 14:13:06,073 INFO L425 stractBuchiCegarLoop]: Abstraction has 45 states and 56 transitions. [2024-11-19 14:13:06,073 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:13:06,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 56 transitions. [2024-11-19 14:13:06,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:13:06,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:13:06,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:13:06,075 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:13:06,075 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:13:06,075 INFO L745 eck$LassoCheckResult]: Stem: 309#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 300#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~ret5#1, main_~x~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 292#L26 call main_#t~ret5#1 := g(main_~x~0#1);< 299#$Ultimate##0 ~x := #in~x; 291#L19 assume !(~x <= 0); 277#L20 call #t~ret2 := f(~x - 1);< 298#$Ultimate##0 ~x := #in~x; 311#L13 assume !(~x <= 0); 290#L14 call #t~ret0 := g(~x);< 294#$Ultimate##0 ~x := #in~x; 289#L19 assume !(~x <= 0); 274#L20 call #t~ret2 := f(~x - 1);< 297#$Ultimate##0 ~x := #in~x; 308#L13 assume ~x <= 0;#res := 0; 273#fFINAL assume true; 275#fEXIT >#31#return; 281#L20-1 call #t~ret3 := f(~x - 2);< 303#$Ultimate##0 ~x := #in~x; 305#L13 assume ~x <= 0;#res := 0; 306#fFINAL assume true; 280#fEXIT >#33#return; 282#L20-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 295#gFINAL assume true; 296#gEXIT >#27#return; 285#L14-1 [2024-11-19 14:13:06,075 INFO L747 eck$LassoCheckResult]: Loop: 285#L14-1 call #t~ret1 := g(1 + ~x);< 288#$Ultimate##0 ~x := #in~x; 315#L19 assume !(~x <= 0); 287#L20 call #t~ret2 := f(~x - 1);< 314#$Ultimate##0 ~x := #in~x; 312#L13 assume !(~x <= 0); 293#L14 call #t~ret0 := g(~x);< 288#$Ultimate##0 ~x := #in~x; 315#L19 assume !(~x <= 0); 287#L20 call #t~ret2 := f(~x - 1);< 314#$Ultimate##0 ~x := #in~x; 312#L13 assume ~x <= 0;#res := 0; 313#fFINAL assume true; 317#fEXIT >#31#return; 286#L20-1 call #t~ret3 := f(~x - 2);< 314#$Ultimate##0 ~x := #in~x; 312#L13 assume ~x <= 0;#res := 0; 313#fFINAL assume true; 317#fEXIT >#33#return; 282#L20-2 #res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; 295#gFINAL assume true; 296#gEXIT >#27#return; 285#L14-1 [2024-11-19 14:13:06,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:06,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1263731607, now seen corresponding path program 1 times [2024-11-19 14:13:06,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:13:06,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887918785] [2024-11-19 14:13:06,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:13:06,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:13:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:06,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:13:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:06,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:13:06,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:06,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1714809691, now seen corresponding path program 1 times [2024-11-19 14:13:06,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:13:06,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681039045] [2024-11-19 14:13:06,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:13:06,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:13:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:06,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:13:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:06,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:13:06,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:13:06,139 INFO L85 PathProgramCache]: Analyzing trace with hash 790919793, now seen corresponding path program 1 times [2024-11-19 14:13:06,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:13:06,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742892564] [2024-11-19 14:13:06,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:13:06,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:13:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:06,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:13:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:06,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:13:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:06,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:13:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:13:06,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-19 14:13:06,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:13:06 BoogieIcfgContainer [2024-11-19 14:13:06,926 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:13:06,927 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:13:06,927 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:13:06,928 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:13:06,928 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:13:04" (3/4) ... [2024-11-19 14:13:06,929 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-19 14:13:06,966 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 14:13:06,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:13:06,967 INFO L158 Benchmark]: Toolchain (without parser) took 2790.11ms. Allocated memory is still 205.5MB. Free memory was 134.2MB in the beginning and 167.7MB in the end (delta: -33.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:13:06,970 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 136.3MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:13:06,970 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.06ms. Allocated memory is still 205.5MB. Free memory was 133.8MB in the beginning and 122.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 14:13:06,971 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.54ms. Allocated memory is still 205.5MB. Free memory was 122.6MB in the beginning and 121.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:13:06,971 INFO L158 Benchmark]: Boogie Preprocessor took 17.18ms. Allocated memory is still 205.5MB. Free memory was 121.5MB in the beginning and 120.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:13:06,971 INFO L158 Benchmark]: RCFGBuilder took 219.05ms. Allocated memory is still 205.5MB. Free memory was 119.8MB in the beginning and 108.6MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 14:13:06,971 INFO L158 Benchmark]: BuchiAutomizer took 2341.78ms. Allocated memory is still 205.5MB. Free memory was 108.6MB in the beginning and 169.8MB in the end (delta: -61.3MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-19 14:13:06,971 INFO L158 Benchmark]: Witness Printer took 39.58ms. Allocated memory is still 205.5MB. Free memory was 169.8MB in the beginning and 167.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:13:06,972 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 136.3MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 150.06ms. Allocated memory is still 205.5MB. Free memory was 133.8MB in the beginning and 122.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.54ms. Allocated memory is still 205.5MB. Free memory was 122.6MB in the beginning and 121.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.18ms. Allocated memory is still 205.5MB. Free memory was 121.5MB in the beginning and 120.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 219.05ms. Allocated memory is still 205.5MB. Free memory was 119.8MB in the beginning and 108.6MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 2341.78ms. Allocated memory is still 205.5MB. Free memory was 108.6MB in the beginning and 169.8MB in the end (delta: -61.3MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Witness Printer took 39.58ms. Allocated memory is still 205.5MB. Free memory was 169.8MB in the beginning and 167.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(x) and consists of 8 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 45 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 3 iterations. TraceHistogramMax:3. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 83 IncrementalHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 29 mSDtfsCounter, 83 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 14]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L25] int x = __VERIFIER_nondet_int(); [L26] CALL g(x) VAL [\old(x)=2] [L19] COND FALSE !(x <= 0) VAL [\old(x)=2, x=2] [L20] CALL, EXPR f(x - 1) VAL [\old(x)=1] [L13] COND FALSE !(x <= 0) VAL [\old(x)=1, x=1] [L14] CALL g(x) VAL [\old(x)=1] [L19] COND FALSE !(x <= 0) VAL [\old(x)=1, x=1] [L20] CALL, EXPR f(x - 1) VAL [\old(x)=0] [L13] COND TRUE x <= 0 [L13] return 0; VAL [\old(x)=0, \result=0] [L20] RET, EXPR f(x - 1) VAL [\old(x)=1, x=1] [L20] CALL, EXPR f(x - 2) VAL [\old(x)=-1] [L13] COND TRUE x <= 0 [L13] return 0; VAL [\old(x)=-1, \result=0] [L20] RET, EXPR f(x - 2) VAL [\old(x)=1, x=1] [L20] return f(x - 1) + f(x - 2); [L14] RET g(x) VAL [\old(x)=1, x=1] Loop: [L14] CALL g(x + 1) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND FALSE !(x <= 0) [L14] CALL g(x) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 1) [L20] CALL, EXPR f(x - 2) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 2) [L20] return f(x - 1) + f(x - 2); [L14] RET g(x) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 14]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L25] int x = __VERIFIER_nondet_int(); [L26] CALL g(x) VAL [\old(x)=2] [L19] COND FALSE !(x <= 0) VAL [\old(x)=2, x=2] [L20] CALL, EXPR f(x - 1) VAL [\old(x)=1] [L13] COND FALSE !(x <= 0) VAL [\old(x)=1, x=1] [L14] CALL g(x) VAL [\old(x)=1] [L19] COND FALSE !(x <= 0) VAL [\old(x)=1, x=1] [L20] CALL, EXPR f(x - 1) VAL [\old(x)=0] [L13] COND TRUE x <= 0 [L13] return 0; VAL [\old(x)=0, \result=0] [L20] RET, EXPR f(x - 1) VAL [\old(x)=1, x=1] [L20] CALL, EXPR f(x - 2) VAL [\old(x)=-1] [L13] COND TRUE x <= 0 [L13] return 0; VAL [\old(x)=-1, \result=0] [L20] RET, EXPR f(x - 2) VAL [\old(x)=1, x=1] [L20] return f(x - 1) + f(x - 2); [L14] RET g(x) VAL [\old(x)=1, x=1] Loop: [L14] CALL g(x + 1) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND FALSE !(x <= 0) [L14] CALL g(x) [L19] COND FALSE !(x <= 0) [L20] CALL, EXPR f(x - 1) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 1) [L20] CALL, EXPR f(x - 2) [L13] COND TRUE x <= 0 [L13] return 0; [L20] RET, EXPR f(x - 2) [L20] return f(x - 1) + f(x - 2); [L14] RET g(x) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-19 14:13:06,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)