./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d 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/recursive/Fibonacci05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 16:04:46,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 16:04:47,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 16:04:47,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 16:04:47,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 16:04:47,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 16:04:47,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 16:04:47,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 16:04:47,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 16:04:47,066 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 16:04:47,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 16:04:47,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 16:04:47,068 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 16:04:47,071 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 16:04:47,071 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 16:04:47,071 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 16:04:47,072 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 16:04:47,072 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 16:04:47,072 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 16:04:47,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 16:04:47,076 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 16:04:47,077 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 16:04:47,077 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 16:04:47,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 16:04:47,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 16:04:47,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 16:04:47,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 16:04:47,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 16:04:47,079 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 16:04:47,079 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 16:04:47,079 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 16:04:47,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 16:04:47,080 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 16:04:47,080 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 16:04:47,081 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 16:04:47,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 16:04:47,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 16:04:47,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 16:04:47,083 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 16:04:47,084 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd [2024-11-09 16:04:47,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 16:04:47,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 16:04:47,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 16:04:47,362 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 16:04:47,363 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 16:04:47,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2024-11-09 16:04:48,864 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 16:04:49,035 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 16:04:49,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2024-11-09 16:04:49,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/607d2f54d/86f828c10d204de2a941e933342dbf25/FLAG121703b7a [2024-11-09 16:04:49,441 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/607d2f54d/86f828c10d204de2a941e933342dbf25 [2024-11-09 16:04:49,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 16:04:49,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 16:04:49,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 16:04:49,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 16:04:49,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 16:04:49,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:04:49" (1/1) ... [2024-11-09 16:04:49,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37290e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:04:49, skipping insertion in model container [2024-11-09 16:04:49,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:04:49" (1/1) ... [2024-11-09 16:04:49,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 16:04:49,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 16:04:49,647 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 16:04:49,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 16:04:49,671 INFO L204 MainTranslator]: Completed translation [2024-11-09 16:04:49,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:04:49 WrapperNode [2024-11-09 16:04:49,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 16:04:49,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 16:04:49,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 16:04:49,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 16:04:49,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:04:49" (1/1) ... [2024-11-09 16:04:49,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:04:49" (1/1) ... [2024-11-09 16:04:49,700 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2024-11-09 16:04:49,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 16:04:49,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 16:04:49,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 16:04:49,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 16:04:49,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:04:49" (1/1) ... [2024-11-09 16:04:49,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:04:49" (1/1) ... [2024-11-09 16:04:49,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:04:49" (1/1) ... [2024-11-09 16:04:49,720 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 16:04:49,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:04:49" (1/1) ... [2024-11-09 16:04:49,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:04:49" (1/1) ... [2024-11-09 16:04:49,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:04:49" (1/1) ... [2024-11-09 16:04:49,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:04:49" (1/1) ... [2024-11-09 16:04:49,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:04:49" (1/1) ... [2024-11-09 16:04:49,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:04:49" (1/1) ... [2024-11-09 16:04:49,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 16:04:49,733 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 16:04:49,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 16:04:49,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 16:04:49,738 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:04:49" (1/1) ... [2024-11-09 16:04:49,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:49,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:49,765 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-09 16:04:49,770 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-09 16:04:49,812 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2024-11-09 16:04:49,812 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2024-11-09 16:04:49,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 16:04:49,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 16:04:49,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 16:04:49,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 16:04:49,863 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 16:04:49,865 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 16:04:49,956 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 16:04:49,956 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 16:04:49,967 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 16:04:49,967 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 16:04:49,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:04:49 BoogieIcfgContainer [2024-11-09 16:04:49,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 16:04:49,969 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 16:04:49,971 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 16:04:49,975 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 16:04:49,976 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 16:04:49,976 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 04:04:49" (1/3) ... [2024-11-09 16:04:49,977 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42987fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 04:04:49, skipping insertion in model container [2024-11-09 16:04:49,977 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 16:04:49,977 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:04:49" (2/3) ... [2024-11-09 16:04:49,978 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42987fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 04:04:49, skipping insertion in model container [2024-11-09 16:04:49,978 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 16:04:49,979 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:04:49" (3/3) ... [2024-11-09 16:04:49,980 INFO L332 chiAutomizerObserver]: Analyzing ICFG Fibonacci05.c [2024-11-09 16:04:50,048 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 16:04:50,049 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 16:04:50,049 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 16:04:50,049 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 16:04:50,049 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 16:04:50,049 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 16:04:50,050 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 16:04:50,050 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 16:04:50,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 16:04:50,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 16:04:50,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:04:50,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:04:50,079 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:04:50,079 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 16:04:50,079 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 16:04:50,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 16:04:50,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 16:04:50,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:04:50,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:04:50,082 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:04:50,082 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 16:04:50,088 INFO L745 eck$LassoCheckResult]: Stem: 17#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 8#L29true call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 14#$Ultimate##0true [2024-11-09 16:04:50,088 INFO L747 eck$LassoCheckResult]: Loop: 14#$Ultimate##0true ~n := #in~n; 4#L17true assume !(~n < 1); 18#L19true assume !(1 == ~n); 16#L22true call #t~ret4 := fibonacci(~n - 1);< 14#$Ultimate##0true [2024-11-09 16:04:50,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:50,094 INFO L85 PathProgramCache]: Analyzing trace with hash 42783, now seen corresponding path program 1 times [2024-11-09 16:04:50,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:04:50,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351756103] [2024-11-09 16:04:50,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:04:50,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:04:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:04:50,177 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:04:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:04:50,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:04:50,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:50,217 INFO L85 PathProgramCache]: Analyzing trace with hash 927643, now seen corresponding path program 1 times [2024-11-09 16:04:50,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:04:50,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701065824] [2024-11-09 16:04:50,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:04:50,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:04:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:04:50,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:04:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:04:50,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:04:50,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:50,246 INFO L85 PathProgramCache]: Analyzing trace with hash 856297401, now seen corresponding path program 1 times [2024-11-09 16:04:50,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:04:50,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869160223] [2024-11-09 16:04:50,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:04:50,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:04:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:04:50,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:04:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:04:50,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:04:50,426 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:04:50,427 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:04:50,427 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:04:50,427 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:04:50,427 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 16:04:50,428 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:50,428 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:04:50,428 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:04:50,428 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration1_Loop [2024-11-09 16:04:50,428 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:04:50,444 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:04:50,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:50,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:50,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:50,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:50,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:50,573 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:04:50,574 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 16:04:50,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:50,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:50,578 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-09 16:04:50,580 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-09 16:04:50,581 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:04:50,582 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:04:50,602 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 16:04:50,603 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 16:04:50,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-09 16:04:50,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:50,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:50,620 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-09 16:04:50,621 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-09 16:04:50,621 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:04:50,622 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:04:50,637 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 16:04:50,638 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret5=0} Honda state: {fibonacci_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 16:04:50,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-09 16:04:50,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:50,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:50,653 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-09 16:04:50,654 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-09 16:04:50,655 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:04:50,655 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:04:50,671 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 16:04:50,671 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 16:04:50,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-09 16:04:50,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:50,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:50,692 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-09 16:04:50,694 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-09 16:04:50,696 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:04:50,696 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:04:50,727 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-09 16:04:50,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:50,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:50,730 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-09 16:04:50,731 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-09 16:04:50,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 16:04:50,733 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:04:50,795 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 16:04:50,800 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-09 16:04:50,800 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:04:50,800 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:04:50,801 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:04:50,801 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:04:50,801 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 16:04:50,801 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:50,801 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:04:50,801 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:04:50,801 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration1_Loop [2024-11-09 16:04:50,801 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:04:50,801 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:04:50,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:50,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:50,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:50,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:50,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:50,882 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:04:50,887 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 16:04:50,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:50,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:50,891 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-09 16:04:50,893 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-09 16:04:50,894 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-09 16:04:50,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:04:50,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:04:50,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:04:50,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:04:50,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:04:50,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:04:50,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:04:50,915 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:04:50,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-09 16:04:50,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:50,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:50,928 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-09 16:04:50,929 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-09 16:04:50,929 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-09 16:04:50,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:04:50,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:04:50,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:04:50,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:04:50,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:04:50,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:04:50,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:04:50,943 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:04:50,954 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-09 16:04:50,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:50,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:50,956 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-09 16:04:50,957 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-09 16:04:50,957 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-09 16:04:50,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:04:50,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:04:50,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:04:50,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:04:50,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:04:50,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:04:50,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:04:50,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:04:50,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-09 16:04:50,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:50,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:51,006 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-09 16:04:51,007 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-09 16:04:51,008 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-09 16:04:51,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:04:51,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:04:51,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:04:51,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:04:51,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:04:51,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:04:51,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:04:51,022 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 16:04:51,027 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 16:04:51,027 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-09 16:04:51,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:51,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:51,062 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-09 16:04:51,063 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-09 16:04:51,064 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 16:04:51,064 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 16:04:51,064 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 16:04:51,065 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2024-11-09 16:04:51,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-09 16:04:51,084 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 16:04:51,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:51,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 16:04:51,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:04:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:51,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 16:04:51,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:04:51,210 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-09 16:04:51,234 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-09 16:04:51,236 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:04:51,321 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 53 transitions. Complement of second has 16 states. [2024-11-09 16:04:51,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 16:04:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:04:51,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2024-11-09 16:04:51,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-09 16:04:51,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:04:51,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 7 letters. Loop has 4 letters. [2024-11-09 16:04:51,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:04:51,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 3 letters. Loop has 8 letters. [2024-11-09 16:04:51,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:04:51,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2024-11-09 16:04:51,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 16:04:51,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 23 states and 31 transitions. [2024-11-09 16:04:51,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-09 16:04:51,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-09 16:04:51,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2024-11-09 16:04:51,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:04:51,343 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-11-09 16:04:51,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2024-11-09 16:04:51,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2024-11-09 16:04:51,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 16:04:51,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-11-09 16:04:51,372 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-09 16:04:51,372 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-09 16:04:51,372 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 16:04:51,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2024-11-09 16:04:51,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 16:04:51,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:04:51,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:04:51,374 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:04:51,375 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:04:51,375 INFO L745 eck$LassoCheckResult]: Stem: 130#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 131#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 120#L29 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 132#$Ultimate##0 ~n := #in~n; 126#L17 assume !(~n < 1); 127#L19 assume !(1 == ~n); 119#L22 call #t~ret4 := fibonacci(~n - 1);< 128#$Ultimate##0 ~n := #in~n; 123#L17 assume ~n < 1;#res := 0; 124#fibonacciFINAL assume true; 129#fibonacciEXIT >#31#return; 118#L22-1 [2024-11-09 16:04:51,376 INFO L747 eck$LassoCheckResult]: Loop: 118#L22-1 call #t~ret5 := fibonacci(~n - 2);< 122#$Ultimate##0 ~n := #in~n; 137#L17 assume !(~n < 1); 136#L19 assume !(1 == ~n); 121#L22 call #t~ret4 := fibonacci(~n - 1);< 122#$Ultimate##0 ~n := #in~n; 137#L17 assume ~n < 1;#res := 0; 134#fibonacciFINAL assume true; 135#fibonacciEXIT >#31#return; 118#L22-1 [2024-11-09 16:04:51,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:51,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2073663503, now seen corresponding path program 1 times [2024-11-09 16:04:51,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:04:51,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073747407] [2024-11-09 16:04:51,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:04:51,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:04:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:51,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 16:04:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:51,547 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-09 16:04:51,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:04:51,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073747407] [2024-11-09 16:04:51,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073747407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:04:51,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:04:51,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 16:04:51,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804203741] [2024-11-09 16:04:51,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:04:51,551 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 16:04:51,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:51,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1606275375, now seen corresponding path program 1 times [2024-11-09 16:04:51,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:04:51,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107325865] [2024-11-09 16:04:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:04:51,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:04:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:51,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 16:04:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:51,618 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-09 16:04:51,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:04:51,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107325865] [2024-11-09 16:04:51,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107325865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:04:51,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:04:51,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 16:04:51,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518328086] [2024-11-09 16:04:51,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:04:51,620 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:04:51,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:04:51,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 16:04:51,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 16:04:51,624 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 16:04:51,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:04:51,684 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2024-11-09 16:04:51,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2024-11-09 16:04:51,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 16:04:51,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 30 transitions. [2024-11-09 16:04:51,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-09 16:04:51,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-09 16:04:51,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2024-11-09 16:04:51,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:04:51,688 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-11-09 16:04:51,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2024-11-09 16:04:51,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 16:04:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 16:04:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-11-09 16:04:51,691 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-11-09 16:04:51,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 16:04:51,692 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-11-09 16:04:51,693 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 16:04:51,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2024-11-09 16:04:51,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 16:04:51,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:04:51,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:04:51,695 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:04:51,695 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-09 16:04:51,695 INFO L745 eck$LassoCheckResult]: Stem: 202#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 203#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 191#L29 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 201#$Ultimate##0 ~n := #in~n; 196#L17 assume !(~n < 1); 197#L19 assume !(1 == ~n); 192#L22 call #t~ret4 := fibonacci(~n - 1);< 198#$Ultimate##0 ~n := #in~n; 194#L17 assume !(~n < 1); 195#L19 assume 1 == ~n;#res := 1; 205#fibonacciFINAL assume true; 208#fibonacciEXIT >#31#return; 189#L22-1 [2024-11-09 16:04:51,695 INFO L747 eck$LassoCheckResult]: Loop: 189#L22-1 call #t~ret5 := fibonacci(~n - 2);< 193#$Ultimate##0 ~n := #in~n; 211#L17 assume !(~n < 1); 209#L19 assume !(1 == ~n); 190#L22 call #t~ret4 := fibonacci(~n - 1);< 193#$Ultimate##0 ~n := #in~n; 211#L17 assume !(~n < 1); 209#L19 assume !(1 == ~n); 190#L22 call #t~ret4 := fibonacci(~n - 1);< 193#$Ultimate##0 ~n := #in~n; 211#L17 assume !(~n < 1); 209#L19 assume 1 == ~n;#res := 1; 210#fibonacciFINAL assume true; 207#fibonacciEXIT >#31#return; 189#L22-1 call #t~ret5 := fibonacci(~n - 2);< 193#$Ultimate##0 ~n := #in~n; 211#L17 assume ~n < 1;#res := 0; 212#fibonacciFINAL assume true; 199#fibonacciEXIT >#33#return; 200#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 204#fibonacciFINAL assume true; 206#fibonacciEXIT >#31#return; 189#L22-1 [2024-11-09 16:04:51,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash -140916419, now seen corresponding path program 1 times [2024-11-09 16:04:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:04:51,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125252878] [2024-11-09 16:04:51,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:04:51,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:04:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:04:51,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:04:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:04:51,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:04:51,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:51,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1749360471, now seen corresponding path program 1 times [2024-11-09 16:04:51,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:04:51,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597222093] [2024-11-09 16:04:51,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:04:51,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:04:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:04:51,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:04:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:04:51,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:04:51,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:51,738 INFO L85 PathProgramCache]: Analyzing trace with hash 998757605, now seen corresponding path program 1 times [2024-11-09 16:04:51,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:04:51,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431606889] [2024-11-09 16:04:51,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:04:51,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:04:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:51,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 16:04:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:51,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 16:04:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:51,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 16:04:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:51,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 16:04:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 16:04:51,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:04:51,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431606889] [2024-11-09 16:04:51,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431606889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:04:51,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307659000] [2024-11-09 16:04:51,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:04:51,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:04:51,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:51,891 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 16:04:51,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 16:04:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:51,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 16:04:51,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:04:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 16:04:51,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:04:52,107 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 16:04:52,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307659000] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:04:52,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:04:52,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2024-11-09 16:04:52,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848965677] [2024-11-09 16:04:52,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:04:52,337 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:04:52,338 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:04:52,338 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:04:52,338 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:04:52,338 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 16:04:52,338 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:52,338 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:04:52,339 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:04:52,339 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration3_Loop [2024-11-09 16:04:52,339 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:04:52,339 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:04:52,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:52,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:52,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:52,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:52,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:52,397 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:04:52,398 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 16:04:52,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:52,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:52,402 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-09 16:04:52,406 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:04:52,406 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:04:52,406 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-09 16:04:52,421 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 16:04:52,421 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#in~n=3} Honda state: {fibonacci_#in~n=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 16:04:52,431 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-09 16:04:52,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:52,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:52,434 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-09 16:04:52,435 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-09 16:04:52,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:04:52,436 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:04:52,447 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 16:04:52,447 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret5=0} Honda state: {fibonacci_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 16:04:52,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-09 16:04:52,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:52,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:52,459 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-09 16:04:52,460 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-09 16:04:52,461 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:04:52,461 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:04:52,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-09 16:04:52,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:52,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:52,488 INFO L229 MonitoredProcess]: Starting monitored process 16 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-09 16:04:52,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-09 16:04:52,489 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 16:04:52,490 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:04:52,502 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 16:04:52,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-09 16:04:52,514 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:04:52,514 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:04:52,514 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:04:52,514 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:04:52,514 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 16:04:52,514 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:52,514 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:04:52,514 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:04:52,514 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration3_Loop [2024-11-09 16:04:52,514 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:04:52,514 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:04:52,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:52,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:52,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:52,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:52,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:52,568 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:04:52,568 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 16:04:52,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:52,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:52,571 INFO L229 MonitoredProcess]: Starting monitored process 17 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-09 16:04:52,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-09 16:04:52,573 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-09 16:04:52,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:04:52,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:04:52,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:04:52,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:04:52,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:04:52,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:04:52,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:04:52,590 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:04:52,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-09 16:04:52,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:52,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:52,607 INFO L229 MonitoredProcess]: Starting monitored process 18 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-09 16:04:52,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-09 16:04:52,625 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-09 16:04:52,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:04:52,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:04:52,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:04:52,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:04:52,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:04:52,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:04:52,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:04:52,679 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:04:52,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-09 16:04:52,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-09 16:04:52,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:52,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:52,697 INFO L229 MonitoredProcess]: Starting monitored process 19 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-09 16:04:52,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-09 16:04:52,699 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-09 16:04:52,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:04:52,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:04:52,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:04:52,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:04:52,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:04:52,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:04:52,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:04:52,712 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 16:04:52,714 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 16:04:52,714 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-09 16:04:52,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:52,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:52,717 INFO L229 MonitoredProcess]: Starting monitored process 20 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-09 16:04:52,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-09 16:04:52,719 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 16:04:52,719 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 16:04:52,719 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 16:04:52,719 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2024-11-09 16:04:52,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-09 16:04:52,731 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 16:04:52,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:52,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 16:04:52,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:04:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:52,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 16:04:52,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:04:53,064 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 16:04:53,065 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2024-11-09 16:04:53,065 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8 Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 16:04:53,333 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Result 152 states and 210 transitions. Complement of second has 54 states. [2024-11-09 16:04:53,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2024-11-09 16:04:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 16:04:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2024-11-09 16:04:53,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 40 transitions. Stem has 12 letters. Loop has 22 letters. [2024-11-09 16:04:53,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:04:53,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 40 transitions. Stem has 34 letters. Loop has 22 letters. [2024-11-09 16:04:53,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:04:53,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 40 transitions. Stem has 12 letters. Loop has 44 letters. [2024-11-09 16:04:53,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:04:53,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 210 transitions. [2024-11-09 16:04:53,352 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2024-11-09 16:04:53,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 125 states and 179 transitions. [2024-11-09 16:04:53,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2024-11-09 16:04:53,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2024-11-09 16:04:53,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 179 transitions. [2024-11-09 16:04:53,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:04:53,362 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 179 transitions. [2024-11-09 16:04:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 179 transitions. [2024-11-09 16:04:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2024-11-09 16:04:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 70 states have internal predecessors, (81), 25 states have call successors, (26), 13 states have call predecessors, (26), 15 states have return successors, (35), 22 states have call predecessors, (35), 23 states have call successors, (35) [2024-11-09 16:04:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 142 transitions. [2024-11-09 16:04:53,378 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 142 transitions. [2024-11-09 16:04:53,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:04:53,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 16:04:53,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 16:04:53,379 INFO L87 Difference]: Start difference. First operand 106 states and 142 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 16:04:53,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:04:53,433 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2024-11-09 16:04:53,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 57 transitions. [2024-11-09 16:04:53,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 16:04:53,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 41 states and 53 transitions. [2024-11-09 16:04:53,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-11-09 16:04:53,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-11-09 16:04:53,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2024-11-09 16:04:53,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:04:53,438 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 53 transitions. [2024-11-09 16:04:53,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2024-11-09 16:04:53,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-11-09 16:04:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 27 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 16:04:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-11-09 16:04:53,444 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-09 16:04:53,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 16:04:53,445 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-09 16:04:53,446 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 16:04:53,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2024-11-09 16:04:53,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 16:04:53,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:04:53,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:04:53,449 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:04:53,449 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-09 16:04:53,449 INFO L745 eck$LassoCheckResult]: Stem: 959#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 960#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 952#L29 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 961#$Ultimate##0 ~n := #in~n; 951#L17 assume !(~n < 1); 953#L19 assume !(1 == ~n); 955#L22 call #t~ret4 := fibonacci(~n - 1);< 956#$Ultimate##0 ~n := #in~n; 967#L17 assume !(~n < 1); 981#L19 assume !(1 == ~n); 962#L22 call #t~ret4 := fibonacci(~n - 1);< 956#$Ultimate##0 ~n := #in~n; 966#L17 assume !(~n < 1); 964#L19 assume 1 == ~n;#res := 1; 965#fibonacciFINAL assume true; 979#fibonacciEXIT >#31#return; 976#L22-1 call #t~ret5 := fibonacci(~n - 2);< 977#$Ultimate##0 ~n := #in~n; 980#L17 assume ~n < 1;#res := 0; 978#fibonacciFINAL assume true; 975#fibonacciEXIT >#33#return; 974#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 973#fibonacciFINAL assume true; 972#fibonacciEXIT >#31#return; 947#L22-1 [2024-11-09 16:04:53,449 INFO L747 eck$LassoCheckResult]: Loop: 947#L22-1 call #t~ret5 := fibonacci(~n - 2);< 954#$Ultimate##0 ~n := #in~n; 970#L17 assume !(~n < 1); 968#L19 assume !(1 == ~n); 946#L22 call #t~ret4 := fibonacci(~n - 1);< 954#$Ultimate##0 ~n := #in~n; 970#L17 assume !(~n < 1); 968#L19 assume !(1 == ~n); 946#L22 call #t~ret4 := fibonacci(~n - 1);< 954#$Ultimate##0 ~n := #in~n; 970#L17 assume !(~n < 1); 968#L19 assume 1 == ~n;#res := 1; 969#fibonacciFINAL assume true; 982#fibonacciEXIT >#31#return; 945#L22-1 call #t~ret5 := fibonacci(~n - 2);< 948#$Ultimate##0 ~n := #in~n; 949#L17 assume ~n < 1;#res := 0; 950#fibonacciFINAL assume true; 957#fibonacciEXIT >#33#return; 958#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 963#fibonacciFINAL assume true; 971#fibonacciEXIT >#31#return; 947#L22-1 [2024-11-09 16:04:53,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:53,450 INFO L85 PathProgramCache]: Analyzing trace with hash 62997961, now seen corresponding path program 2 times [2024-11-09 16:04:53,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:04:53,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701447737] [2024-11-09 16:04:53,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:04:53,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:04:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:04:53,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:04:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:04:53,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:04:53,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:53,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1749360471, now seen corresponding path program 2 times [2024-11-09 16:04:53,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:04:53,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276603488] [2024-11-09 16:04:53,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:04:53,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:04:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:04:53,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:04:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:04:53,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:04:53,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:53,477 INFO L85 PathProgramCache]: Analyzing trace with hash 969547889, now seen corresponding path program 3 times [2024-11-09 16:04:53,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:04:53,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877705099] [2024-11-09 16:04:53,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:04:53,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:04:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:53,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 16:04:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:53,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 16:04:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:53,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 16:04:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:53,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 16:04:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:53,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 16:04:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:53,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 16:04:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:53,675 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 16 proven. 46 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-09 16:04:53,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:04:53,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877705099] [2024-11-09 16:04:53,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877705099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:04:53,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415099079] [2024-11-09 16:04:53,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 16:04:53,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:04:53,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:53,678 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 16:04:53,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-09 16:04:53,731 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-09 16:04:53,731 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 16:04:53,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 16:04:53,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:04:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 35 proven. 47 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 16:04:53,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:04:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 35 proven. 49 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 16:04:54,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415099079] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:04:54,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:04:54,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 21 [2024-11-09 16:04:54,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045204260] [2024-11-09 16:04:54,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:04:54,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-09 16:04:54,411 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:04:54,411 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:04:54,412 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:04:54,412 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:04:54,412 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 16:04:54,412 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:54,412 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:04:54,412 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:04:54,412 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration4_Loop [2024-11-09 16:04:54,412 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:04:54,412 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:04:54,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:54,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:54,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:54,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:54,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:54,460 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:04:54,460 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 16:04:54,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:54,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:54,463 INFO L229 MonitoredProcess]: Starting monitored process 22 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-09 16:04:54,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-09 16:04:54,466 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:04:54,466 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:04:54,480 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 16:04:54,480 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#in~n=3} Honda state: {fibonacci_#in~n=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 16:04:54,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-09 16:04:54,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:54,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:54,498 INFO L229 MonitoredProcess]: Starting monitored process 23 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-09 16:04:54,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-09 16:04:54,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:04:54,500 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:04:54,515 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 16:04:54,515 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 16:04:54,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-09 16:04:54,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:54,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:54,533 INFO L229 MonitoredProcess]: Starting monitored process 24 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-09 16:04:54,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-09 16:04:54,535 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:04:54,535 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:04:54,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-09 16:04:54,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:54,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:54,566 INFO L229 MonitoredProcess]: Starting monitored process 25 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-09 16:04:54,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-09 16:04:54,571 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 16:04:54,571 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:04:54,585 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 16:04:54,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-09 16:04:54,595 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:04:54,595 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:04:54,595 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:04:54,595 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:04:54,596 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 16:04:54,596 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:54,596 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:04:54,596 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:04:54,596 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration4_Loop [2024-11-09 16:04:54,596 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:04:54,596 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:04:54,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:54,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:54,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:54,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:54,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:54,650 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:04:54,650 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 16:04:54,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:54,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:54,653 INFO L229 MonitoredProcess]: Starting monitored process 26 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-09 16:04:54,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-09 16:04:54,655 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-09 16:04:54,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:04:54,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:04:54,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:04:54,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:04:54,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:04:54,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:04:54,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:04:54,668 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:04:54,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-09 16:04:54,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:54,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:54,679 INFO L229 MonitoredProcess]: Starting monitored process 27 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-09 16:04:54,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-09 16:04:54,681 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-09 16:04:54,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:04:54,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:04:54,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:04:54,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:04:54,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:04:54,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:04:54,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:04:54,694 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 16:04:54,696 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-09 16:04:54,696 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 16:04:54,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:54,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:54,699 INFO L229 MonitoredProcess]: Starting monitored process 28 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-09 16:04:54,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-09 16:04:54,701 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 16:04:54,701 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 16:04:54,701 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 16:04:54,702 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2024-11-09 16:04:54,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-09 16:04:54,713 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 16:04:54,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:54,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 16:04:54,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:04:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:54,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 16:04:54,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:04:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 16:04:55,096 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2024-11-09 16:04:55,096 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11 Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 16:04:55,192 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Result 45 states and 54 transitions. Complement of second has 11 states. [2024-11-09 16:04:55,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 16:04:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 16:04:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2024-11-09 16:04:55,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 24 letters. Loop has 22 letters. [2024-11-09 16:04:55,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:04:55,194 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 16:04:55,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:55,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 16:04:55,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:04:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:55,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 16:04:55,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:04:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 16:04:55,529 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2024-11-09 16:04:55,529 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11 Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 16:04:55,620 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Result 45 states and 54 transitions. Complement of second has 11 states. [2024-11-09 16:04:55,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 16:04:55,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 16:04:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2024-11-09 16:04:55,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 24 letters. Loop has 22 letters. [2024-11-09 16:04:55,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:04:55,622 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 16:04:55,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:55,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 16:04:55,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-09 16:04:55,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:04:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:55,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 16:04:55,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:04:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 16:04:55,977 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2024-11-09 16:04:55,977 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11 Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 16:04:56,197 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Result 331 states and 432 transitions. Complement of second has 134 states. [2024-11-09 16:04:56,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2024-11-09 16:04:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 16:04:56,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2024-11-09 16:04:56,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 24 letters. Loop has 22 letters. [2024-11-09 16:04:56,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:04:56,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 46 letters. Loop has 22 letters. [2024-11-09 16:04:56,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:04:56,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 24 letters. Loop has 44 letters. [2024-11-09 16:04:56,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:04:56,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331 states and 432 transitions. [2024-11-09 16:04:56,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-09 16:04:56,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331 states to 215 states and 294 transitions. [2024-11-09 16:04:56,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2024-11-09 16:04:56,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2024-11-09 16:04:56,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 215 states and 294 transitions. [2024-11-09 16:04:56,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:04:56,215 INFO L218 hiAutomatonCegarLoop]: Abstraction has 215 states and 294 transitions. [2024-11-09 16:04:56,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states and 294 transitions. [2024-11-09 16:04:56,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 173. [2024-11-09 16:04:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 113 states have internal predecessors, (122), 38 states have call successors, (42), 23 states have call predecessors, (42), 28 states have return successors, (61), 36 states have call predecessors, (61), 36 states have call successors, (61) [2024-11-09 16:04:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 225 transitions. [2024-11-09 16:04:56,235 INFO L240 hiAutomatonCegarLoop]: Abstraction has 173 states and 225 transitions. [2024-11-09 16:04:56,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:04:56,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 16:04:56,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2024-11-09 16:04:56,236 INFO L87 Difference]: Start difference. First operand 173 states and 225 transitions. Second operand has 21 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 18 states have internal predecessors, (49), 13 states have call successors, (17), 3 states have call predecessors, (17), 7 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2024-11-09 16:04:56,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:04:56,487 INFO L93 Difference]: Finished difference Result 344 states and 500 transitions. [2024-11-09 16:04:56,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 344 states and 500 transitions. [2024-11-09 16:04:56,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-09 16:04:56,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 344 states to 334 states and 487 transitions. [2024-11-09 16:04:56,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 170 [2024-11-09 16:04:56,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 190 [2024-11-09 16:04:56,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 334 states and 487 transitions. [2024-11-09 16:04:56,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:04:56,501 INFO L218 hiAutomatonCegarLoop]: Abstraction has 334 states and 487 transitions. [2024-11-09 16:04:56,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states and 487 transitions. [2024-11-09 16:04:56,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 265. [2024-11-09 16:04:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 164 states have (on average 1.1341463414634145) internal successors, (186), 166 states have internal predecessors, (186), 60 states have call successors, (72), 35 states have call predecessors, (72), 41 states have return successors, (136), 63 states have call predecessors, (136), 58 states have call successors, (136) [2024-11-09 16:04:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 394 transitions. [2024-11-09 16:04:56,543 INFO L240 hiAutomatonCegarLoop]: Abstraction has 265 states and 394 transitions. [2024-11-09 16:04:56,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 16:04:56,544 INFO L425 stractBuchiCegarLoop]: Abstraction has 265 states and 394 transitions. [2024-11-09 16:04:56,547 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 16:04:56,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 265 states and 394 transitions. [2024-11-09 16:04:56,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-09 16:04:56,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:04:56,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:04:56,551 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 9, 7, 7, 5, 5, 4, 4, 3, 2, 1, 1, 1] [2024-11-09 16:04:56,553 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 16:04:56,553 INFO L745 eck$LassoCheckResult]: Stem: 2933#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 2934#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 2935#L29 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 2936#$Ultimate##0 ~n := #in~n; 2982#L17 assume !(~n < 1); 2980#L19 assume !(1 == ~n); 2972#L22 call #t~ret4 := fibonacci(~n - 1);< 2975#$Ultimate##0 ~n := #in~n; 2981#L17 assume !(~n < 1); 2979#L19 assume !(1 == ~n); 2973#L22 call #t~ret4 := fibonacci(~n - 1);< 2975#$Ultimate##0 ~n := #in~n; 2981#L17 assume !(~n < 1); 2979#L19 assume !(1 == ~n); 2973#L22 call #t~ret4 := fibonacci(~n - 1);< 2975#$Ultimate##0 ~n := #in~n; 2981#L17 assume !(~n < 1); 2979#L19 assume !(1 == ~n); 2973#L22 call #t~ret4 := fibonacci(~n - 1);< 2975#$Ultimate##0 ~n := #in~n; 2983#L17 assume !(~n < 1); 3109#L19 assume 1 == ~n;#res := 1; 3107#fibonacciFINAL assume true; 3104#fibonacciEXIT >#31#return; 3101#L22-1 call #t~ret5 := fibonacci(~n - 2);< 3102#$Ultimate##0 ~n := #in~n; 3108#L17 assume ~n < 1;#res := 0; 3106#fibonacciFINAL assume true; 3100#fibonacciEXIT >#33#return; 3098#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 3097#fibonacciFINAL assume true; 3094#fibonacciEXIT >#31#return; 3006#L22-1 call #t~ret5 := fibonacci(~n - 2);< 3007#$Ultimate##0 ~n := #in~n; 3053#L17 assume !(~n < 1); 3021#L19 assume 1 == ~n;#res := 1; 2960#fibonacciFINAL assume true; 3004#fibonacciEXIT >#33#return; 3002#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 2997#fibonacciFINAL assume true; 2988#fibonacciEXIT >#31#return; 2987#L22-1 call #t~ret5 := fibonacci(~n - 2);< 2990#$Ultimate##0 ~n := #in~n; 3064#L17 assume !(~n < 1); 3019#L19 assume !(1 == ~n); 3020#L22 call #t~ret4 := fibonacci(~n - 1);< 3167#$Ultimate##0 ~n := #in~n; 3113#L17 assume !(~n < 1); 3115#L19 assume 1 == ~n;#res := 1; 3168#fibonacciFINAL assume true; 3165#fibonacciEXIT >#31#return; 2950#L22-1 call #t~ret5 := fibonacci(~n - 2);< 2949#$Ultimate##0 ~n := #in~n; 2952#L17 assume ~n < 1;#res := 0; 3009#fibonacciFINAL assume true; 3000#fibonacciEXIT >#33#return; 3001#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 2996#fibonacciFINAL assume true; 2986#fibonacciEXIT >#33#return; 2974#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 2977#fibonacciFINAL assume true; 2971#fibonacciEXIT >#31#return; 2965#L22-1 call #t~ret5 := fibonacci(~n - 2);< 2966#$Ultimate##0 ~n := #in~n; 3172#L17 assume !(~n < 1); 3171#L19 assume !(1 == ~n); 3127#L22 call #t~ret4 := fibonacci(~n - 1);< 3166#$Ultimate##0 ~n := #in~n; 3142#L17 assume !(~n < 1); 3143#L19 assume !(1 == ~n); 3122#L22 call #t~ret4 := fibonacci(~n - 1);< 3128#$Ultimate##0 [2024-11-09 16:04:56,553 INFO L747 eck$LassoCheckResult]: Loop: 3128#$Ultimate##0 ~n := #in~n; 3140#L17 assume !(~n < 1); 3138#L19 assume !(1 == ~n); 3124#L22 call #t~ret4 := fibonacci(~n - 1);< 3128#$Ultimate##0 [2024-11-09 16:04:56,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:56,554 INFO L85 PathProgramCache]: Analyzing trace with hash -627327765, now seen corresponding path program 4 times [2024-11-09 16:04:56,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:04:56,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727228933] [2024-11-09 16:04:56,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:04:56,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:04:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:04:56,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:04:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:04:56,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:04:56,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:56,591 INFO L85 PathProgramCache]: Analyzing trace with hash 927643, now seen corresponding path program 2 times [2024-11-09 16:04:56,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:04:56,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152676942] [2024-11-09 16:04:56,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:04:56,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:04:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:04:56,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:04:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:04:56,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:04:56,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:56,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2068668293, now seen corresponding path program 5 times [2024-11-09 16:04:56,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:04:56,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78101884] [2024-11-09 16:04:56,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:04:56,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:04:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:56,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 16:04:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:56,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 16:04:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:56,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 16:04:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:57,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 16:04:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:57,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 16:04:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:57,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 16:04:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:57,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 16:04:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:57,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 16:04:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:57,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 16:04:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 110 proven. 115 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-09 16:04:57,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:04:57,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78101884] [2024-11-09 16:04:57,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78101884] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:04:57,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807356542] [2024-11-09 16:04:57,054 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 16:04:57,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:04:57,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:57,055 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 16:04:57,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-09 16:04:57,116 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-11-09 16:04:57,117 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 16:04:57,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 16:04:57,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:04:57,198 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 110 proven. 115 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-09 16:04:57,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:04:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 110 proven. 130 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-09 16:04:57,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807356542] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:04:57,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:04:57,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 15] total 20 [2024-11-09 16:04:57,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336537832] [2024-11-09 16:04:57,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:04:57,731 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:04:57,731 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:04:57,731 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:04:57,731 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:04:57,731 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 16:04:57,731 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:57,731 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:04:57,731 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:04:57,731 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration5_Loop [2024-11-09 16:04:57,732 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:04:57,732 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:04:57,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:57,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:57,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:57,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:57,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:57,768 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:04:57,769 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 16:04:57,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:57,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:57,770 INFO L229 MonitoredProcess]: Starting monitored process 30 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-09 16:04:57,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-09 16:04:57,772 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:04:57,772 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:04:57,783 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 16:04:57,783 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret4=0} Honda state: {fibonacci_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 16:04:57,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-09 16:04:57,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:57,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:57,794 INFO L229 MonitoredProcess]: Starting monitored process 31 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-09 16:04:57,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-09 16:04:57,796 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:04:57,796 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:04:57,806 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 16:04:57,806 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 16:04:57,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-09 16:04:57,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:57,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:57,817 INFO L229 MonitoredProcess]: Starting monitored process 32 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-09 16:04:57,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-09 16:04:57,819 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:04:57,819 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:04:57,830 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 16:04:57,830 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 16:04:57,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-09 16:04:57,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:57,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:57,841 INFO L229 MonitoredProcess]: Starting monitored process 33 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-09 16:04:57,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-09 16:04:57,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:04:57,843 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:04:57,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-09 16:04:57,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:57,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:57,865 INFO L229 MonitoredProcess]: Starting monitored process 34 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-09 16:04:57,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-09 16:04:57,866 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 16:04:57,866 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:04:57,891 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 16:04:57,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-09 16:04:57,895 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:04:57,895 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:04:57,895 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:04:57,896 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:04:57,896 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 16:04:57,896 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:57,896 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:04:57,896 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:04:57,896 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration5_Loop [2024-11-09 16:04:57,896 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:04:57,896 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:04:57,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:57,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:57,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:57,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:57,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:04:57,941 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:04:57,941 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 16:04:57,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:57,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:57,943 INFO L229 MonitoredProcess]: Starting monitored process 35 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-09 16:04:57,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-09 16:04:57,946 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-09 16:04:57,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:04:57,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:04:57,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:04:57,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:04:57,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:04:57,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:04:57,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:04:57,966 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:04:57,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-09 16:04:57,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:57,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:57,985 INFO L229 MonitoredProcess]: Starting monitored process 36 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-09 16:04:57,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-09 16:04:57,988 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-09 16:04:58,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:04:58,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:04:58,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:04:58,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:04:58,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:04:58,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:04:58,001 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:04:58,003 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:04:58,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-09 16:04:58,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:58,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:58,019 INFO L229 MonitoredProcess]: Starting monitored process 37 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-09 16:04:58,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-09 16:04:58,022 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-09 16:04:58,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:04:58,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:04:58,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:04:58,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:04:58,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:04:58,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:04:58,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:04:58,040 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:04:58,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-09 16:04:58,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:58,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:58,057 INFO L229 MonitoredProcess]: Starting monitored process 38 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-09 16:04:58,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-09 16:04:58,059 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-09 16:04:58,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:04:58,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:04:58,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:04:58,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:04:58,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:04:58,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:04:58,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:04:58,074 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 16:04:58,076 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-09 16:04:58,077 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 16:04:58,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:04:58,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:04:58,079 INFO L229 MonitoredProcess]: Starting monitored process 39 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-09 16:04:58,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-09 16:04:58,101 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 16:04:58,101 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 16:04:58,102 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 16:04:58,102 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2024-11-09 16:04:58,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-09 16:04:58,117 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 16:04:58,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:58,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 16:04:58,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:04:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:58,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 16:04:58,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:04:58,688 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-09 16:04:58,688 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-11-09 16:04:58,689 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 265 states and 394 transitions. cyclomatic complexity: 133 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 16:04:58,749 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 265 states and 394 transitions. cyclomatic complexity: 133. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 287 states and 420 transitions. Complement of second has 17 states. [2024-11-09 16:04:58,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 16:04:58,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 16:04:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2024-11-09 16:04:58,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 71 letters. Loop has 4 letters. [2024-11-09 16:04:58,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:04:58,752 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 16:04:58,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:58,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 16:04:58,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:04:59,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-09 16:04:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:59,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 16:04:59,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:04:59,325 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-09 16:04:59,326 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2024-11-09 16:04:59,326 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 265 states and 394 transitions. cyclomatic complexity: 133 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 16:04:59,381 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 265 states and 394 transitions. cyclomatic complexity: 133. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 287 states and 420 transitions. Complement of second has 17 states. [2024-11-09 16:04:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 16:04:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 16:04:59,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2024-11-09 16:04:59,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 71 letters. Loop has 4 letters. [2024-11-09 16:04:59,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:04:59,382 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 16:04:59,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:04:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:59,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 16:04:59,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:04:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:04:59,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 16:04:59,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:04:59,890 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-09 16:04:59,890 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-11-09 16:04:59,890 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 265 states and 394 transitions. cyclomatic complexity: 133 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 16:04:59,953 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 265 states and 394 transitions. cyclomatic complexity: 133. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 340 states and 477 transitions. Complement of second has 19 states. [2024-11-09 16:04:59,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 16:04:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 16:04:59,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2024-11-09 16:04:59,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 71 letters. Loop has 4 letters. [2024-11-09 16:04:59,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:04:59,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 75 letters. Loop has 4 letters. [2024-11-09 16:04:59,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:04:59,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 71 letters. Loop has 8 letters. [2024-11-09 16:04:59,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:04:59,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 340 states and 477 transitions. [2024-11-09 16:04:59,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-09 16:04:59,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 340 states to 279 states and 410 transitions. [2024-11-09 16:04:59,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 132 [2024-11-09 16:04:59,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2024-11-09 16:04:59,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 279 states and 410 transitions. [2024-11-09 16:04:59,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:04:59,974 INFO L218 hiAutomatonCegarLoop]: Abstraction has 279 states and 410 transitions. [2024-11-09 16:04:59,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 410 transitions. [2024-11-09 16:04:59,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 271. [2024-11-09 16:04:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 169 states have (on average 1.1301775147928994) internal successors, (191), 171 states have internal predecessors, (191), 61 states have call successors, (73), 36 states have call predecessors, (73), 41 states have return successors, (138), 63 states have call predecessors, (138), 59 states have call successors, (138) [2024-11-09 16:04:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 402 transitions. [2024-11-09 16:04:59,998 INFO L240 hiAutomatonCegarLoop]: Abstraction has 271 states and 402 transitions. [2024-11-09 16:04:59,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:04:59,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 16:04:59,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2024-11-09 16:04:59,999 INFO L87 Difference]: Start difference. First operand 271 states and 402 transitions. Second operand has 20 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 16 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-09 16:05:00,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:05:00,173 INFO L93 Difference]: Finished difference Result 483 states and 750 transitions. [2024-11-09 16:05:00,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 483 states and 750 transitions. [2024-11-09 16:05:00,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-09 16:05:00,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 483 states to 478 states and 743 transitions. [2024-11-09 16:05:00,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 247 [2024-11-09 16:05:00,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 254 [2024-11-09 16:05:00,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 478 states and 743 transitions. [2024-11-09 16:05:00,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:05:00,188 INFO L218 hiAutomatonCegarLoop]: Abstraction has 478 states and 743 transitions. [2024-11-09 16:05:00,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states and 743 transitions. [2024-11-09 16:05:00,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 362. [2024-11-09 16:05:00,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 225 states have (on average 1.1511111111111112) internal successors, (259), 225 states have internal predecessors, (259), 83 states have call successors, (99), 48 states have call predecessors, (99), 54 states have return successors, (218), 88 states have call predecessors, (218), 81 states have call successors, (218) [2024-11-09 16:05:00,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 576 transitions. [2024-11-09 16:05:00,239 INFO L240 hiAutomatonCegarLoop]: Abstraction has 362 states and 576 transitions. [2024-11-09 16:05:00,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 16:05:00,240 INFO L425 stractBuchiCegarLoop]: Abstraction has 362 states and 576 transitions. [2024-11-09 16:05:00,240 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 16:05:00,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 362 states and 576 transitions. [2024-11-09 16:05:00,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-09 16:05:00,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:05:00,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:05:00,245 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 16, 15, 11, 10, 8, 8, 7, 7, 5, 3, 1, 1, 1] [2024-11-09 16:05:00,245 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 16:05:00,245 INFO L745 eck$LassoCheckResult]: Stem: 6250#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 6251#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 6252#L29 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 6253#$Ultimate##0 ~n := #in~n; 6315#L17 assume !(~n < 1); 6313#L19 assume !(1 == ~n); 6288#L22 call #t~ret4 := fibonacci(~n - 1);< 6311#$Ultimate##0 ~n := #in~n; 6309#L17 assume !(~n < 1); 6307#L19 assume !(1 == ~n); 6221#L22 call #t~ret4 := fibonacci(~n - 1);< 6292#$Ultimate##0 ~n := #in~n; 6310#L17 assume !(~n < 1); 6308#L19 assume !(1 == ~n); 6222#L22 call #t~ret4 := fibonacci(~n - 1);< 6292#$Ultimate##0 ~n := #in~n; 6310#L17 assume !(~n < 1); 6308#L19 assume !(1 == ~n); 6222#L22 call #t~ret4 := fibonacci(~n - 1);< 6292#$Ultimate##0 ~n := #in~n; 6310#L17 assume !(~n < 1); 6308#L19 assume !(1 == ~n); 6222#L22 call #t~ret4 := fibonacci(~n - 1);< 6292#$Ultimate##0 ~n := #in~n; 6312#L17 assume !(~n < 1); 6260#L19 assume 1 == ~n;#res := 1; 6261#fibonacciFINAL assume true; 6555#fibonacciEXIT >#31#return; 6220#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6223#$Ultimate##0 ~n := #in~n; 6579#L17 assume ~n < 1;#res := 0; 6578#fibonacciFINAL assume true; 6576#fibonacciEXIT >#33#return; 6575#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6572#fibonacciFINAL assume true; 6569#fibonacciEXIT >#31#return; 6238#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6361#$Ultimate##0 ~n := #in~n; 6381#L17 assume !(~n < 1); 6367#L19 assume 1 == ~n;#res := 1; 6273#fibonacciFINAL assume true; 6359#fibonacciEXIT >#33#return; 6355#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6350#fibonacciFINAL assume true; 6306#fibonacciEXIT >#31#return; 6241#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6302#$Ultimate##0 ~n := #in~n; 6393#L17 assume !(~n < 1); 6394#L19 assume !(1 == ~n); 6327#L22 call #t~ret4 := fibonacci(~n - 1);< 6348#$Ultimate##0 ~n := #in~n; 6466#L17 assume !(~n < 1); 6349#L19 assume 1 == ~n;#res := 1; 6347#fibonacciFINAL assume true; 6325#fibonacciEXIT >#31#return; 6319#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6324#$Ultimate##0 ~n := #in~n; 6377#L17 assume ~n < 1;#res := 0; 6376#fibonacciFINAL assume true; 6316#fibonacciEXIT >#33#return; 6314#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6304#fibonacciFINAL assume true; 6300#fibonacciEXIT >#33#return; 6296#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6294#fibonacciFINAL assume true; 6290#fibonacciEXIT >#31#return; 6240#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6278#$Ultimate##0 ~n := #in~n; 6279#L17 assume !(~n < 1); 6286#L19 assume !(1 == ~n); 6274#L22 call #t~ret4 := fibonacci(~n - 1);< 6431#$Ultimate##0 ~n := #in~n; 6432#L17 assume !(~n < 1); 6428#L19 assume !(1 == ~n); 6410#L22 call #t~ret4 := fibonacci(~n - 1);< 6415#$Ultimate##0 ~n := #in~n; 6397#L17 assume !(~n < 1); 6416#L19 assume 1 == ~n;#res := 1; 6413#fibonacciFINAL assume true; 6409#fibonacciEXIT >#31#return; 6401#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6407#$Ultimate##0 ~n := #in~n; 6412#L17 assume ~n < 1;#res := 0; 6408#fibonacciFINAL assume true; 6399#fibonacciEXIT >#33#return; 6405#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6574#fibonacciFINAL assume true; 6571#fibonacciEXIT >#31#return; 6360#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6361#$Ultimate##0 ~n := #in~n; 6381#L17 assume !(~n < 1); 6367#L19 assume 1 == ~n;#res := 1; 6273#fibonacciFINAL assume true; 6359#fibonacciEXIT >#33#return; 6355#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6350#fibonacciFINAL assume true; 6306#fibonacciEXIT >#33#return; 6291#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6435#fibonacciFINAL assume true; 6297#fibonacciEXIT >#31#return; 6280#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6281#$Ultimate##0 ~n := #in~n; 6287#L17 assume !(~n < 1); 6478#L19 assume !(1 == ~n); 6234#L22 call #t~ret4 := fibonacci(~n - 1);< 6490#$Ultimate##0 ~n := #in~n; 6491#L17 assume !(~n < 1); 6567#L19 assume !(1 == ~n); 6233#L22 call #t~ret4 := fibonacci(~n - 1);< 6236#$Ultimate##0 ~n := #in~n; 6265#L17 assume !(~n < 1); 6512#L19 assume !(1 == ~n); 6264#L22 [2024-11-09 16:05:00,246 INFO L747 eck$LassoCheckResult]: Loop: 6264#L22 call #t~ret4 := fibonacci(~n - 1);< 6236#$Ultimate##0 ~n := #in~n; 6265#L17 assume !(~n < 1); 6512#L19 assume !(1 == ~n); 6264#L22 [2024-11-09 16:05:00,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:05:00,246 INFO L85 PathProgramCache]: Analyzing trace with hash -315610179, now seen corresponding path program 6 times [2024-11-09 16:05:00,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:05:00,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060650118] [2024-11-09 16:05:00,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:05:00,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:05:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:05:00,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:05:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:05:00,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:05:00,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:05:00,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1817383, now seen corresponding path program 3 times [2024-11-09 16:05:00,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:05:00,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201235664] [2024-11-09 16:05:00,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:05:00,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:05:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:05:00,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:05:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:05:00,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:05:00,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:05:00,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1033349347, now seen corresponding path program 7 times [2024-11-09 16:05:00,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:05:00,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512496425] [2024-11-09 16:05:00,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:05:00,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:05:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:00,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 16:05:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:00,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 16:05:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:00,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 16:05:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:00,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 16:05:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:00,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 16:05:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:00,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 16:05:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:00,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 16:05:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:00,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 16:05:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:00,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 16:05:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:00,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 16:05:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:00,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 16:05:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:00,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 16:05:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:00,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 16:05:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:00,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 16:05:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:00,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 16:05:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 231 proven. 268 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2024-11-09 16:05:00,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:05:00,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512496425] [2024-11-09 16:05:00,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512496425] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:05:00,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907331904] [2024-11-09 16:05:00,835 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 16:05:00,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:05:00,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:05:00,839 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 16:05:00,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-11-09 16:05:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:00,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 16:05:00,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:05:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 231 proven. 268 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2024-11-09 16:05:00,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:05:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 231 proven. 294 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-11-09 16:05:01,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907331904] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:05:01,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:05:01,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 17] total 23 [2024-11-09 16:05:01,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041256564] [2024-11-09 16:05:01,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:05:01,755 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:05:01,755 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:05:01,755 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:05:01,755 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:05:01,756 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 16:05:01,756 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:05:01,756 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:05:01,756 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:05:01,756 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration6_Loop [2024-11-09 16:05:01,756 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:05:01,756 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:05:01,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:05:01,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:05:01,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:05:01,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:05:01,805 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:05:01,805 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 16:05:01,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:05:01,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:05:01,807 INFO L229 MonitoredProcess]: Starting monitored process 41 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-09 16:05:01,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-09 16:05:01,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:05:01,811 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:05:01,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-09 16:05:01,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:05:01,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:05:01,847 INFO L229 MonitoredProcess]: Starting monitored process 42 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-09 16:05:01,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-09 16:05:01,849 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 16:05:01,849 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:05:03,014 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 16:05:03,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-09 16:05:03,019 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:05:03,019 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:05:03,020 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:05:03,020 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:05:03,020 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 16:05:03,020 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:05:03,020 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:05:03,020 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:05:03,020 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration6_Loop [2024-11-09 16:05:03,020 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:05:03,020 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:05:03,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:05:03,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:05:03,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:05:03,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:05:03,057 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:05:03,057 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 16:05:03,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:05:03,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:05:03,058 INFO L229 MonitoredProcess]: Starting monitored process 43 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-09 16:05:03,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-09 16:05:03,060 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-09 16:05:03,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:05:03,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:05:03,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:05:03,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:05:03,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:05:03,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:05:03,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:05:03,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:05:03,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-11-09 16:05:03,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:05:03,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:05:03,083 INFO L229 MonitoredProcess]: Starting monitored process 44 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-09 16:05:03,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-09 16:05:03,085 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-09 16:05:03,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:05:03,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:05:03,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:05:03,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:05:03,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:05:03,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:05:03,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:05:03,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:05:03,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-09 16:05:03,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:05:03,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:05:03,109 INFO L229 MonitoredProcess]: Starting monitored process 45 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-09 16:05:03,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-09 16:05:03,110 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-09 16:05:03,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:05:03,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:05:03,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:05:03,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:05:03,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:05:03,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:05:03,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:05:03,123 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 16:05:03,125 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 16:05:03,125 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-09 16:05:03,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:05:03,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:05:03,127 INFO L229 MonitoredProcess]: Starting monitored process 46 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-09 16:05:03,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-09 16:05:03,128 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 16:05:03,129 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 16:05:03,129 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 16:05:03,129 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2024-11-09 16:05:03,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-09 16:05:03,140 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 16:05:03,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:05:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:03,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 16:05:03,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:05:03,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-09 16:05:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:04,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 16:05:04,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:05:04,034 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-09 16:05:04,034 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-09 16:05:04,035 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 362 states and 576 transitions. cyclomatic complexity: 218 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 16:05:04,086 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 362 states and 576 transitions. cyclomatic complexity: 218. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 369 states and 584 transitions. Complement of second has 18 states. [2024-11-09 16:05:04,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 16:05:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 16:05:04,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2024-11-09 16:05:04,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 112 letters. Loop has 4 letters. [2024-11-09 16:05:04,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:05:04,087 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 16:05:04,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:05:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:04,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 16:05:04,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:05:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:04,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 16:05:04,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:05:04,841 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-09 16:05:04,842 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-09 16:05:04,842 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 362 states and 576 transitions. cyclomatic complexity: 218 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 16:05:04,909 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 362 states and 576 transitions. cyclomatic complexity: 218. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 377 states and 592 transitions. Complement of second has 17 states. [2024-11-09 16:05:04,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2024-11-09 16:05:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 16:05:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2024-11-09 16:05:04,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 112 letters. Loop has 4 letters. [2024-11-09 16:05:04,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:05:04,911 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 16:05:04,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:05:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:05,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 16:05:05,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:05:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:05:05,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 16:05:05,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:05:05,632 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-09 16:05:05,632 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-09 16:05:05,632 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 362 states and 576 transitions. cyclomatic complexity: 218 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 16:05:05,675 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 362 states and 576 transitions. cyclomatic complexity: 218. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 425 states and 667 transitions. Complement of second has 21 states. [2024-11-09 16:05:05,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 16:05:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 16:05:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2024-11-09 16:05:05,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 112 letters. Loop has 4 letters. [2024-11-09 16:05:05,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:05:05,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 116 letters. Loop has 4 letters. [2024-11-09 16:05:05,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:05:05,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 112 letters. Loop has 8 letters. [2024-11-09 16:05:05,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:05:05,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 425 states and 667 transitions. [2024-11-09 16:05:05,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-09 16:05:05,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 425 states to 362 states and 576 transitions. [2024-11-09 16:05:05,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2024-11-09 16:05:05,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2024-11-09 16:05:05,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 362 states and 576 transitions. [2024-11-09 16:05:05,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:05:05,688 INFO L218 hiAutomatonCegarLoop]: Abstraction has 362 states and 576 transitions. [2024-11-09 16:05:05,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states and 576 transitions. [2024-11-09 16:05:05,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2024-11-09 16:05:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 225 states have (on average 1.1511111111111112) internal successors, (259), 225 states have internal predecessors, (259), 83 states have call successors, (99), 48 states have call predecessors, (99), 54 states have return successors, (218), 88 states have call predecessors, (218), 81 states have call successors, (218) [2024-11-09 16:05:05,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 576 transitions. [2024-11-09 16:05:05,699 INFO L240 hiAutomatonCegarLoop]: Abstraction has 362 states and 576 transitions. [2024-11-09 16:05:05,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:05:05,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 16:05:05,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2024-11-09 16:05:05,700 INFO L87 Difference]: Start difference. First operand 362 states and 576 transitions. Second operand has 24 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 19 states have call successors, (21), 5 states have call predecessors, (21), 6 states have return successors, (23), 10 states have call predecessors, (23), 15 states have call successors, (23) [2024-11-09 16:05:05,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:05:05,878 INFO L93 Difference]: Finished difference Result 542 states and 862 transitions. [2024-11-09 16:05:05,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 542 states and 862 transitions. [2024-11-09 16:05:05,884 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 16:05:05,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 542 states to 0 states and 0 transitions. [2024-11-09 16:05:05,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 16:05:05,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 16:05:05,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 16:05:05,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:05:05,885 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 16:05:05,885 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 16:05:05,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 16:05:05,886 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 16:05:05,886 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 16:05:05,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-09 16:05:05,886 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 16:05:05,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-09 16:05:05,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 04:05:05 BoogieIcfgContainer [2024-11-09 16:05:05,893 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 16:05:05,894 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 16:05:05,894 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 16:05:05,894 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 16:05:05,895 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:04:49" (3/4) ... [2024-11-09 16:05:05,897 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 16:05:05,898 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 16:05:05,898 INFO L158 Benchmark]: Toolchain (without parser) took 16450.83ms. Allocated memory was 165.7MB in the beginning and 310.4MB in the end (delta: 144.7MB). Free memory was 109.6MB in the beginning and 198.9MB in the end (delta: -89.3MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. [2024-11-09 16:05:05,898 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 165.7MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 16:05:05,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.93ms. Allocated memory is still 165.7MB. Free memory was 109.2MB in the beginning and 97.4MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 16:05:05,899 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.78ms. Allocated memory is still 165.7MB. Free memory was 97.4MB in the beginning and 95.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 16:05:05,899 INFO L158 Benchmark]: Boogie Preprocessor took 30.73ms. Allocated memory is still 165.7MB. Free memory was 95.9MB in the beginning and 94.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 16:05:05,899 INFO L158 Benchmark]: RCFGBuilder took 235.59ms. Allocated memory is still 165.7MB. Free memory was 94.4MB in the beginning and 84.4MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 16:05:05,900 INFO L158 Benchmark]: BuchiAutomizer took 15924.50ms. Allocated memory was 165.7MB in the beginning and 310.4MB in the end (delta: 144.7MB). Free memory was 84.0MB in the beginning and 198.9MB in the end (delta: -115.0MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2024-11-09 16:05:05,900 INFO L158 Benchmark]: Witness Printer took 3.81ms. Allocated memory is still 310.4MB. Free memory was 198.9MB in the beginning and 198.9MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 16:05:05,901 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.24ms. Allocated memory is still 165.7MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.93ms. Allocated memory is still 165.7MB. Free memory was 109.2MB in the beginning and 97.4MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.78ms. Allocated memory is still 165.7MB. Free memory was 97.4MB in the beginning and 95.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.73ms. Allocated memory is still 165.7MB. Free memory was 95.9MB in the beginning and 94.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 235.59ms. Allocated memory is still 165.7MB. Free memory was 94.4MB in the beginning and 84.4MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 15924.50ms. Allocated memory was 165.7MB in the beginning and 310.4MB in the end (delta: 144.7MB). Free memory was 84.0MB in the beginning and 198.9MB in the end (delta: -115.0MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * Witness Printer took 3.81ms. Allocated memory is still 310.4MB. Free memory was 198.9MB in the beginning and 198.9MB in the end (delta: 2.0kB). 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 10 terminating modules (5 trivial, 2 deterministic, 3 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 5 locations. One deterministic module has affine ranking function n and consists of 11 locations. One nondeterministic module has affine ranking function n and consists of 11 locations. One nondeterministic module has affine ranking function \old(n) and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.8s and 7 iterations. TraceHistogramMax:19. Analysis of lassos took 8.0s. Construction of modules took 0.7s. Büchi inclusion checks took 6.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 260 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 16/46 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 485 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 438 mSDsluCounter, 477 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 286 mSDsCounter, 425 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 869 IncrementalHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 425 mSolverCounterUnsat, 191 mSDtfsCounter, 869 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT4 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax100 hnf100 lsp82 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf92 smp80 dnf100 smp100 tf112 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.6s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-09 16:05:05,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2024-11-09 16:05:06,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-11-09 16:05:06,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-09 16:05:06,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 16:05:06,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE