./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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-simple/fibo_2calls_5-1.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 24cc882af4ec42ba94c424c5a1ed92d402543c0fe2bf17d3fca0ca1cd73500b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 16:18:01,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 16:18:01,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 16:18:01,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 16:18:01,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 16:18:01,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 16:18:01,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 16:18:01,688 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 16:18:01,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 16:18:01,688 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 16:18:01,689 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 16:18:01,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 16:18:01,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 16:18:01,689 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 16:18:01,690 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 16:18:01,690 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 16:18:01,690 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 16:18:01,690 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 16:18:01,690 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 16:18:01,690 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 16:18:01,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 16:18:01,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 16:18:01,690 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 16:18:01,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 16:18:01,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 16:18:01,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 16:18:01,691 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 16:18:01,691 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 16:18:01,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 16:18:01,691 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 16:18:01,691 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 16:18:01,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 16:18:01,692 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 16:18:01,692 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 16:18:01,692 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 16:18:01,692 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 16:18:01,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 16:18:01,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 16:18:01,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 16:18:01,693 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 16:18:01,693 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 24cc882af4ec42ba94c424c5a1ed92d402543c0fe2bf17d3fca0ca1cd73500b7 [2025-03-04 16:18:01,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 16:18:01,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 16:18:01,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 16:18:01,902 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 16:18:01,902 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 16:18:01,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2025-03-04 16:18:03,033 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deecb61aa/8f4b4dd9a11848519b0b0574ea232859/FLAG3742d3c2b [2025-03-04 16:18:03,234 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 16:18:03,236 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2025-03-04 16:18:03,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deecb61aa/8f4b4dd9a11848519b0b0574ea232859/FLAG3742d3c2b [2025-03-04 16:18:03,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deecb61aa/8f4b4dd9a11848519b0b0574ea232859 [2025-03-04 16:18:03,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 16:18:03,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 16:18:03,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 16:18:03,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 16:18:03,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 16:18:03,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:18:03" (1/1) ... [2025-03-04 16:18:03,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c70fbb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:18:03, skipping insertion in model container [2025-03-04 16:18:03,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:18:03" (1/1) ... [2025-03-04 16:18:03,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 16:18:03,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:18:03,727 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 16:18:03,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:18:03,752 INFO L204 MainTranslator]: Completed translation [2025-03-04 16:18:03,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:18:03 WrapperNode [2025-03-04 16:18:03,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 16:18:03,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 16:18:03,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 16:18:03,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 16:18:03,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:18:03" (1/1) ... [2025-03-04 16:18:03,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:18:03" (1/1) ... [2025-03-04 16:18:03,775 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 20 [2025-03-04 16:18:03,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 16:18:03,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 16:18:03,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 16:18:03,778 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 16:18:03,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:18:03" (1/1) ... [2025-03-04 16:18:03,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:18:03" (1/1) ... [2025-03-04 16:18:03,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:18:03" (1/1) ... [2025-03-04 16:18:03,795 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]. [2025-03-04 16:18:03,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:18:03" (1/1) ... [2025-03-04 16:18:03,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:18:03" (1/1) ... [2025-03-04 16:18:03,798 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:18:03" (1/1) ... [2025-03-04 16:18:03,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:18:03" (1/1) ... [2025-03-04 16:18:03,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:18:03" (1/1) ... [2025-03-04 16:18:03,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:18:03" (1/1) ... [2025-03-04 16:18:03,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 16:18:03,803 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 16:18:03,803 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 16:18:03,803 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 16:18:03,804 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:18:03" (1/1) ... [2025-03-04 16:18:03,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:03,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:03,832 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) [2025-03-04 16:18:03,835 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 [2025-03-04 16:18:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 16:18:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 16:18:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2025-03-04 16:18:03,856 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2025-03-04 16:18:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2025-03-04 16:18:03,857 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2025-03-04 16:18:03,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 16:18:03,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 16:18:03,909 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 16:18:03,910 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:18:03,977 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25: havoc #t~ret6;havoc #t~ret7; [2025-03-04 16:18:03,987 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: havoc #t~ret4;havoc #t~ret5; [2025-03-04 16:18:03,994 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 16:18:03,994 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:18:04,000 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:18:04,000 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:18:04,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:18:04 BoogieIcfgContainer [2025-03-04 16:18:04,000 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:18:04,001 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:18:04,001 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:18:04,004 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:18:04,005 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:18:04,005 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 04:18:03" (1/3) ... [2025-03-04 16:18:04,006 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f06a9dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:18:04, skipping insertion in model container [2025-03-04 16:18:04,006 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:18:04,006 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:18:03" (2/3) ... [2025-03-04 16:18:04,006 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f06a9dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:18:04, skipping insertion in model container [2025-03-04 16:18:04,006 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:18:04,006 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:18:04" (3/3) ... [2025-03-04 16:18:04,007 INFO L363 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_5-1.c [2025-03-04 16:18:04,040 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:18:04,040 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:18:04,040 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:18:04,041 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:18:04,041 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:18:04,041 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:18:04,041 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:18:04,041 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:18:04,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 16:18:04,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-03-04 16:18:04,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:18:04,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:18:04,058 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:18:04,059 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:18:04,059 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:18:04,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 16:18:04,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-03-04 16:18:04,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:18:04,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:18:04,061 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:18:04,061 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:18:04,064 INFO L752 eck$LassoCheckResult]: Stem: "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(18, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 5;" "call main_#t~ret8#1 := fibo1(main_~x~0#1);"< [2025-03-04 16:18:04,064 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< [2025-03-04 16:18:04,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:04,068 INFO L85 PathProgramCache]: Analyzing trace with hash 39712, now seen corresponding path program 1 times [2025-03-04 16:18:04,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:04,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870168019] [2025-03-04 16:18:04,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:04,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:04,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:18:04,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:18:04,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:04,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:04,124 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:18:04,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:18:04,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:18:04,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:04,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:04,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:18:04,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:04,142 INFO L85 PathProgramCache]: Analyzing trace with hash -255777251, now seen corresponding path program 1 times [2025-03-04 16:18:04,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:04,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610504790] [2025-03-04 16:18:04,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:04,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:04,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:18:04,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:18:04,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:04,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:04,149 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:18:04,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:18:04,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:18:04,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:04,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:04,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:18:04,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:04,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1413493308, now seen corresponding path program 1 times [2025-03-04 16:18:04,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:04,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451469232] [2025-03-04 16:18:04,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:04,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:04,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 16:18:04,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 16:18:04,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:04,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:04,167 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:18:04,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 16:18:04,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 16:18:04,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:04,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:04,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:18:04,339 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:18:04,339 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:18:04,340 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:18:04,340 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:18:04,340 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:18:04,340 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:04,340 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:18:04,340 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:18:04,340 INFO L132 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5-1.c_Iteration1_Loop [2025-03-04 16:18:04,340 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:18:04,341 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:18:04,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:04,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:04,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:04,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:04,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:04,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:04,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:04,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:04,444 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:18:04,445 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:18:04,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:04,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:04,448 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) [2025-03-04 16:18:04,449 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 [2025-03-04 16:18:04,450 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:04,450 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:04,463 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:04,463 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:04,468 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 [2025-03-04 16:18:04,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:04,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:04,471 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) [2025-03-04 16:18:04,472 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 [2025-03-04 16:18:04,473 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:04,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:04,485 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:04,485 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:04,491 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 [2025-03-04 16:18:04,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:04,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:04,493 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) [2025-03-04 16:18:04,494 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 [2025-03-04 16:18:04,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:04,498 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:04,509 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:04,510 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:04,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-04 16:18:04,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:04,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:04,519 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) [2025-03-04 16:18:04,523 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 [2025-03-04 16:18:04,525 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:04,525 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:04,537 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:04,537 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret5=0} Honda state: {fibo1_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:04,543 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 [2025-03-04 16:18:04,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:04,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:04,545 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) [2025-03-04 16:18:04,546 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 [2025-03-04 16:18:04,547 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:04,547 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:04,558 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:04,558 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret4=0} Honda state: {fibo1_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:04,564 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 [2025-03-04 16:18:04,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:04,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:04,567 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) [2025-03-04 16:18:04,567 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 [2025-03-04 16:18:04,568 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:04,568 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:04,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-04 16:18:04,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:04,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:04,588 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) [2025-03-04 16:18:04,590 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 [2025-03-04 16:18:04,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:18:04,590 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:04,630 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:18:04,634 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 [2025-03-04 16:18:04,635 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:18:04,635 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:18:04,635 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:18:04,635 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:18:04,635 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:18:04,635 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:04,635 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:18:04,635 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:18:04,635 INFO L132 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5-1.c_Iteration1_Loop [2025-03-04 16:18:04,635 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:18:04,635 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:18:04,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:04,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:04,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:04,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:04,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:04,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:04,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:04,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:04,712 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:18:04,714 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:18:04,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:04,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:04,717 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) [2025-03-04 16:18:04,718 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 [2025-03-04 16:18:04,718 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 [2025-03-04 16:18:04,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:04,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:04,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:04,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:04,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:04,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:04,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:04,734 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:04,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-04 16:18:04,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:04,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:04,741 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) [2025-03-04 16:18:04,742 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 [2025-03-04 16:18:04,743 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 [2025-03-04 16:18:04,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:04,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:04,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:04,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:04,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:04,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:04,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:04,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:04,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-04 16:18:04,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:04,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:04,762 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) [2025-03-04 16:18:04,763 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 [2025-03-04 16:18:04,764 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 [2025-03-04 16:18:04,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:04,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:04,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:04,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:04,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:04,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:04,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:04,776 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:04,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-04 16:18:04,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:04,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:04,784 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:18:04,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 16:18:04,785 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 [2025-03-04 16:18:04,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:04,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:04,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:04,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:04,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:04,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:04,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:04,797 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:04,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-04 16:18:04,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:04,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:04,805 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) [2025-03-04 16:18:04,807 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 [2025-03-04 16:18:04,808 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 [2025-03-04 16:18:04,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:04,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:04,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:04,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:04,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:04,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:04,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:04,821 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:04,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-04 16:18:04,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:04,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:04,829 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) [2025-03-04 16:18:04,839 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 [2025-03-04 16:18:04,839 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 [2025-03-04 16:18:04,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:04,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:04,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:04,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:04,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:04,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:04,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:04,853 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:18:04,856 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:18:04,858 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 16:18:04,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:04,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:04,862 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) [2025-03-04 16:18:04,863 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 [2025-03-04 16:18:04,865 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:18:04,865 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:18:04,865 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:18:04,866 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2025-03-04 16:18:04,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-04 16:18:04,874 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:18:04,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:04,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:18:04,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:18:04,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:04,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:04,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:18:04,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:04,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:18:04,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:18:04,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:04,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:04,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 16:18:04,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:05,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:18:05,030 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-03-04 16:18:05,032 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 27 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:18:05,179 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 27 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5). Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 77 states and 107 transitions. Complement of second has 28 states. [2025-03-04 16:18:05,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-03-04 16:18:05,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:18:05,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2025-03-04 16:18:05,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 3 letters. Loop has 8 letters. [2025-03-04 16:18:05,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:18:05,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 11 letters. Loop has 8 letters. [2025-03-04 16:18:05,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:18:05,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 3 letters. Loop has 16 letters. [2025-03-04 16:18:05,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:18:05,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 107 transitions. [2025-03-04 16:18:05,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-03-04 16:18:05,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 55 states and 75 transitions. [2025-03-04 16:18:05,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2025-03-04 16:18:05,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-03-04 16:18:05,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 75 transitions. [2025-03-04 16:18:05,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:18:05,202 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 75 transitions. [2025-03-04 16:18:05,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 75 transitions. [2025-03-04 16:18:05,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2025-03-04 16:18:05,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-04 16:18:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2025-03-04 16:18:05,220 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 72 transitions. [2025-03-04 16:18:05,220 INFO L432 stractBuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2025-03-04 16:18:05,220 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:18:05,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 72 transitions. [2025-03-04 16:18:05,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-03-04 16:18:05,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:18:05,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:18:05,222 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:18:05,222 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:18:05,222 INFO L752 eck$LassoCheckResult]: Stem: "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(18, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 5;" "call main_#t~ret8#1 := fibo1(main_~x~0#1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#37#return;" [2025-03-04 16:18:05,222 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#37#return;" [2025-03-04 16:18:05,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:05,223 INFO L85 PathProgramCache]: Analyzing trace with hash -130896422, now seen corresponding path program 1 times [2025-03-04 16:18:05,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:05,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817525435] [2025-03-04 16:18:05,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:05,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:05,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 16:18:05,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 16:18:05,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:05,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 16:18:05,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:18:05,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817525435] [2025-03-04 16:18:05,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817525435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:18:05,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:18:05,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 16:18:05,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863360968] [2025-03-04 16:18:05,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:18:05,341 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:18:05,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:05,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1646684539, now seen corresponding path program 1 times [2025-03-04 16:18:05,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:05,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995430769] [2025-03-04 16:18:05,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:05,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:05,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 16:18:05,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 16:18:05,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:05,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 16:18:05,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:18:05,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995430769] [2025-03-04 16:18:05,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995430769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:18:05,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:18:05,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 16:18:05,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689314384] [2025-03-04 16:18:05,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:18:05,418 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:18:05,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:18:05,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 16:18:05,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 16:18:05,421 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. cyclomatic complexity: 20 Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 16:18:05,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:18:05,471 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2025-03-04 16:18:05,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 81 transitions. [2025-03-04 16:18:05,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-03-04 16:18:05,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 60 states and 79 transitions. [2025-03-04 16:18:05,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2025-03-04 16:18:05,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-03-04 16:18:05,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 79 transitions. [2025-03-04 16:18:05,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:18:05,475 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 79 transitions. [2025-03-04 16:18:05,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 79 transitions. [2025-03-04 16:18:05,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-04 16:18:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (18), 7 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-04 16:18:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2025-03-04 16:18:05,482 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 79 transitions. [2025-03-04 16:18:05,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:18:05,484 INFO L432 stractBuchiCegarLoop]: Abstraction has 60 states and 79 transitions. [2025-03-04 16:18:05,484 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 16:18:05,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 79 transitions. [2025-03-04 16:18:05,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-03-04 16:18:05,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:18:05,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:18:05,488 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:18:05,488 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:18:05,488 INFO L752 eck$LassoCheckResult]: Stem: "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(18, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 5;" "call main_#t~ret8#1 := fibo1(main_~x~0#1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#37#return;" [2025-03-04 16:18:05,488 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#37#return;" [2025-03-04 16:18:05,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:05,488 INFO L85 PathProgramCache]: Analyzing trace with hash 237378914, now seen corresponding path program 1 times [2025-03-04 16:18:05,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:05,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444675167] [2025-03-04 16:18:05,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:05,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:05,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 16:18:05,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 16:18:05,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:05,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:05,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:18:05,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:18:05,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444675167] [2025-03-04 16:18:05,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444675167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:18:05,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599523132] [2025-03-04 16:18:05,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:05,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:18:05,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:05,574 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:18:05,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 16:18:05,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 16:18:05,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 16:18:05,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:05,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:05,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 16:18:05,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:05,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:18:05,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:18:05,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:18:05,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599523132] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:18:05,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:18:05,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-04 16:18:05,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459896808] [2025-03-04 16:18:05,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:18:05,751 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:18:05,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:05,751 INFO L85 PathProgramCache]: Analyzing trace with hash -492186143, now seen corresponding path program 1 times [2025-03-04 16:18:05,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:05,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148814004] [2025-03-04 16:18:05,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:05,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:05,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:18:05,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:18:05,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:05,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:05,759 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:18:05,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:18:05,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:18:05,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:05,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:05,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:18:05,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-04 16:18:05,932 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:18:05,932 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:18:05,932 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:18:05,932 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:18:05,932 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:18:05,932 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:05,932 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:18:05,932 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:18:05,932 INFO L132 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5-1.c_Iteration3_Loop [2025-03-04 16:18:05,932 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:18:05,932 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:18:05,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:05,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:05,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:05,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:05,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:05,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:05,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:05,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:05,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:05,987 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:18:05,987 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:18:05,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:05,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:05,989 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) [2025-03-04 16:18:05,991 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 [2025-03-04 16:18:05,992 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:05,992 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:06,004 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:06,004 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=2} Honda state: {fibo2_#in~n=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:06,010 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 [2025-03-04 16:18:06,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:06,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:06,013 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) [2025-03-04 16:18:06,014 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 [2025-03-04 16:18:06,017 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:06,017 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:06,027 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:06,028 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret5=0} Honda state: {fibo1_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:06,033 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 [2025-03-04 16:18:06,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:06,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:06,036 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) [2025-03-04 16:18:06,037 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 [2025-03-04 16:18:06,037 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:06,037 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:06,047 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:06,048 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret7=0} Honda state: {fibo2_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:06,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-04 16:18:06,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:06,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:06,055 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) [2025-03-04 16:18:06,057 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 [2025-03-04 16:18:06,057 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:06,057 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:06,068 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:06,068 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret4=0} Honda state: {fibo1_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:06,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-04 16:18:06,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:06,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:06,075 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2025-03-04 16:18:06,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-04 16:18:06,076 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:06,076 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:06,087 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:06,087 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret6=1} Honda state: {fibo2_#t~ret6=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:06,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-04 16:18:06,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:06,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:06,095 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) [2025-03-04 16:18:06,096 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 [2025-03-04 16:18:06,098 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:06,098 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:06,112 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:06,112 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:06,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-04 16:18:06,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:06,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:06,121 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) [2025-03-04 16:18:06,122 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 [2025-03-04 16:18:06,123 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:06,123 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:06,139 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 [2025-03-04 16:18:06,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:06,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:06,141 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) [2025-03-04 16:18:06,142 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 [2025-03-04 16:18:06,143 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:18:06,143 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:06,154 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:18:06,160 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 [2025-03-04 16:18:06,160 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:18:06,160 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:18:06,160 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:18:06,160 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:18:06,160 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:18:06,160 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:06,160 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:18:06,160 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:18:06,160 INFO L132 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5-1.c_Iteration3_Loop [2025-03-04 16:18:06,160 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:18:06,160 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:18:06,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:06,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:06,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:06,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:06,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:06,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:06,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:06,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:06,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:06,215 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:18:06,215 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:18:06,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:06,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:06,217 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) [2025-03-04 16:18:06,218 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 [2025-03-04 16:18:06,219 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 [2025-03-04 16:18:06,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:06,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:06,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:06,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:06,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:06,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:06,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:06,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:06,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-04 16:18:06,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:06,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:06,243 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) [2025-03-04 16:18:06,243 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 [2025-03-04 16:18:06,245 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 [2025-03-04 16:18:06,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:06,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:06,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:06,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:06,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:06,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:06,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:06,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:06,261 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 [2025-03-04 16:18:06,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:06,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:06,264 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) [2025-03-04 16:18:06,265 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 [2025-03-04 16:18:06,266 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 [2025-03-04 16:18:06,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:06,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:06,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:06,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:06,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:06,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:06,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:06,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:06,286 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 [2025-03-04 16:18:06,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:06,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:06,288 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) [2025-03-04 16:18:06,289 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 [2025-03-04 16:18:06,290 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 [2025-03-04 16:18:06,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:06,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:06,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:06,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:06,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:06,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:06,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:06,302 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:06,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-04 16:18:06,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:06,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:06,309 INFO L229 MonitoredProcess]: Starting monitored process 29 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) [2025-03-04 16:18:06,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-04 16:18:06,311 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 [2025-03-04 16:18:06,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:06,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:06,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:06,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:06,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:06,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:06,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:06,322 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:06,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-04 16:18:06,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:06,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:06,330 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) [2025-03-04 16:18:06,331 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 [2025-03-04 16:18:06,332 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 [2025-03-04 16:18:06,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:06,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:06,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:06,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:06,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:06,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:06,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:06,345 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:18:06,347 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:18:06,347 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 16:18:06,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:06,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:06,349 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) [2025-03-04 16:18:06,351 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 [2025-03-04 16:18:06,352 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:18:06,352 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:18:06,352 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:18:06,352 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2025-03-04 16:18:06,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-04 16:18:06,359 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:18:06,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:06,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 16:18:06,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 16:18:06,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:06,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:06,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 16:18:06,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:06,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:18:06,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:18:06,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:06,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:06,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 16:18:06,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:18:06,568 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2025-03-04 16:18:06,569 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 79 transitions. cyclomatic complexity: 21 Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 16:18:06,821 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 [2025-03-04 16:18:06,927 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 79 transitions. cyclomatic complexity: 21. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Result 206 states and 282 transitions. Complement of second has 48 states. [2025-03-04 16:18:06,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2025-03-04 16:18:06,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 16:18:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2025-03-04 16:18:06,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 79 transitions. Stem has 16 letters. Loop has 14 letters. [2025-03-04 16:18:06,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:18:06,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 79 transitions. Stem has 30 letters. Loop has 14 letters. [2025-03-04 16:18:06,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:18:06,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 79 transitions. Stem has 16 letters. Loop has 28 letters. [2025-03-04 16:18:06,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:18:06,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 206 states and 282 transitions. [2025-03-04 16:18:06,933 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2025-03-04 16:18:06,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 206 states to 182 states and 254 transitions. [2025-03-04 16:18:06,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2025-03-04 16:18:06,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2025-03-04 16:18:06,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 254 transitions. [2025-03-04 16:18:06,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:18:06,937 INFO L218 hiAutomatonCegarLoop]: Abstraction has 182 states and 254 transitions. [2025-03-04 16:18:06,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 254 transitions. [2025-03-04 16:18:06,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 154. [2025-03-04 16:18:06,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 96 states have (on average 1.28125) internal successors, (123), 104 states have internal predecessors, (123), 35 states have call successors, (36), 19 states have call predecessors, (36), 23 states have return successors, (52), 30 states have call predecessors, (52), 33 states have call successors, (52) [2025-03-04 16:18:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 211 transitions. [2025-03-04 16:18:06,949 INFO L240 hiAutomatonCegarLoop]: Abstraction has 154 states and 211 transitions. [2025-03-04 16:18:06,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:18:06,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 16:18:06,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-04 16:18:06,950 INFO L87 Difference]: Start difference. First operand 154 states and 211 transitions. Second operand has 15 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 10 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 16:18:07,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:18:07,123 INFO L93 Difference]: Finished difference Result 191 states and 256 transitions. [2025-03-04 16:18:07,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 256 transitions. [2025-03-04 16:18:07,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2025-03-04 16:18:07,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 185 states and 248 transitions. [2025-03-04 16:18:07,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2025-03-04 16:18:07,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2025-03-04 16:18:07,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 185 states and 248 transitions. [2025-03-04 16:18:07,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:18:07,129 INFO L218 hiAutomatonCegarLoop]: Abstraction has 185 states and 248 transitions. [2025-03-04 16:18:07,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states and 248 transitions. [2025-03-04 16:18:07,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2025-03-04 16:18:07,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 106 states have (on average 1.2547169811320755) internal successors, (133), 116 states have internal predecessors, (133), 40 states have call successors, (42), 21 states have call predecessors, (42), 26 states have return successors, (58), 34 states have call predecessors, (58), 37 states have call successors, (58) [2025-03-04 16:18:07,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 233 transitions. [2025-03-04 16:18:07,143 INFO L240 hiAutomatonCegarLoop]: Abstraction has 172 states and 233 transitions. [2025-03-04 16:18:07,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 16:18:07,147 INFO L432 stractBuchiCegarLoop]: Abstraction has 172 states and 233 transitions. [2025-03-04 16:18:07,147 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 16:18:07,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 172 states and 233 transitions. [2025-03-04 16:18:07,149 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2025-03-04 16:18:07,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:18:07,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:18:07,150 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 16:18:07,150 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:18:07,151 INFO L752 eck$LassoCheckResult]: Stem: "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(18, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 5;" "call main_#t~ret8#1 := fibo1(main_~x~0#1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#41#return;" "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#41#return;" "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#39#return;" "#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#35#return;" "#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7;" "assume true;" >"#39#return;" "#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7;" "assume true;" >"#41#return;" [2025-03-04 16:18:07,151 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#41#return;" [2025-03-04 16:18:07,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:07,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1382290243, now seen corresponding path program 1 times [2025-03-04 16:18:07,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:07,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847817382] [2025-03-04 16:18:07,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:07,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:07,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 16:18:07,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 16:18:07,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:07,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 19 proven. 57 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 16:18:07,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:18:07,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847817382] [2025-03-04 16:18:07,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847817382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:18:07,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571091501] [2025-03-04 16:18:07,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:07,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:18:07,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:07,423 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:18:07,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-04 16:18:07,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 16:18:07,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 16:18:07,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:07,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:07,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 16:18:07,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:07,596 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 26 proven. 59 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 16:18:07,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:18:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 26 proven. 60 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 16:18:07,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571091501] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:18:07,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:18:07,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 28 [2025-03-04 16:18:07,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526828929] [2025-03-04 16:18:07,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:18:07,981 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:18:07,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:07,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1399922189, now seen corresponding path program 1 times [2025-03-04 16:18:07,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:07,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813881220] [2025-03-04 16:18:07,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:07,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:07,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 16:18:07,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 16:18:07,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:07,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 16:18:08,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:18:08,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813881220] [2025-03-04 16:18:08,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813881220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:18:08,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:18:08,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 16:18:08,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318919286] [2025-03-04 16:18:08,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:18:08,026 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:18:08,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:18:08,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 16:18:08,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 16:18:08,026 INFO L87 Difference]: Start difference. First operand 172 states and 233 transitions. cyclomatic complexity: 66 Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 16:18:08,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:18:08,065 INFO L93 Difference]: Finished difference Result 189 states and 249 transitions. [2025-03-04 16:18:08,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 249 transitions. [2025-03-04 16:18:08,067 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2025-03-04 16:18:08,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 177 states and 235 transitions. [2025-03-04 16:18:08,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2025-03-04 16:18:08,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2025-03-04 16:18:08,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 235 transitions. [2025-03-04 16:18:08,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:18:08,078 INFO L218 hiAutomatonCegarLoop]: Abstraction has 177 states and 235 transitions. [2025-03-04 16:18:08,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 235 transitions. [2025-03-04 16:18:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 163. [2025-03-04 16:18:08,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 102 states have (on average 1.2156862745098038) internal successors, (124), 113 states have internal predecessors, (124), 35 states have call successors, (36), 20 states have call predecessors, (36), 26 states have return successors, (53), 29 states have call predecessors, (53), 32 states have call successors, (53) [2025-03-04 16:18:08,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 213 transitions. [2025-03-04 16:18:08,085 INFO L240 hiAutomatonCegarLoop]: Abstraction has 163 states and 213 transitions. [2025-03-04 16:18:08,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:18:08,086 INFO L432 stractBuchiCegarLoop]: Abstraction has 163 states and 213 transitions. [2025-03-04 16:18:08,086 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 16:18:08,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 213 transitions. [2025-03-04 16:18:08,087 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2025-03-04 16:18:08,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:18:08,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:18:08,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 7, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 16:18:08,089 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:18:08,089 INFO L752 eck$LassoCheckResult]: Stem: "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(18, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 5;" "call main_#t~ret8#1 := fibo1(main_~x~0#1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#41#return;" "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#41#return;" "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#39#return;" "#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#35#return;" "#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7;" "assume true;" >"#39#return;" "#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#41#return;" "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#39#return;" "#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#35#return;" "#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7;" "assume true;" >"#41#return;" [2025-03-04 16:18:08,089 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#41#return;" [2025-03-04 16:18:08,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:08,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1276613125, now seen corresponding path program 1 times [2025-03-04 16:18:08,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:08,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350301301] [2025-03-04 16:18:08,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:08,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:08,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 16:18:08,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 16:18:08,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:08,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 23 proven. 79 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-04 16:18:08,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:18:08,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350301301] [2025-03-04 16:18:08,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350301301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:18:08,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534840842] [2025-03-04 16:18:08,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:08,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:18:08,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:08,279 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:18:08,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-04 16:18:08,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 16:18:08,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 16:18:08,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:08,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:08,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 16:18:08,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 23 proven. 98 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-03-04 16:18:08,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:18:08,736 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 23 proven. 99 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-04 16:18:08,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534840842] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:18:08,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:18:08,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 19 [2025-03-04 16:18:08,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515145400] [2025-03-04 16:18:08,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:18:08,737 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:18:08,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:08,738 INFO L85 PathProgramCache]: Analyzing trace with hash 448115169, now seen corresponding path program 1 times [2025-03-04 16:18:08,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:08,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566650741] [2025-03-04 16:18:08,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:08,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:08,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:18:08,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:18:08,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:08,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:08,742 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:18:08,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:18:08,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:18:08,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:08,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:08,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:18:08,862 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:18:08,863 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:18:08,863 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:18:08,863 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:18:08,863 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:18:08,863 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:08,863 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:18:08,863 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:18:08,863 INFO L132 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5-1.c_Iteration5_Loop [2025-03-04 16:18:08,863 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:18:08,863 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:18:08,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:08,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:08,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:08,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:08,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:08,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:08,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:08,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:08,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:08,907 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:18:08,908 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:18:08,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:08,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:08,910 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) [2025-03-04 16:18:08,910 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 [2025-03-04 16:18:08,911 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:08,911 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:08,922 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:08,922 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:08,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-04 16:18:08,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:08,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:08,929 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) [2025-03-04 16:18:08,930 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 [2025-03-04 16:18:08,931 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:08,931 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:08,941 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:08,941 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#in~n=0} Honda state: {fibo2_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:08,947 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 [2025-03-04 16:18:08,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:08,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:08,949 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) [2025-03-04 16:18:08,950 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 [2025-03-04 16:18:08,951 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:08,951 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:08,961 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:08,961 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret6=0} Honda state: {fibo2_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:08,966 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 [2025-03-04 16:18:08,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:08,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:08,968 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) [2025-03-04 16:18:08,969 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 [2025-03-04 16:18:08,970 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:08,970 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:08,981 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:08,981 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:08,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-04 16:18:08,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:08,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:08,988 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) [2025-03-04 16:18:08,989 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 [2025-03-04 16:18:08,990 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:08,990 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:09,000 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:09,000 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret7=0} Honda state: {fibo2_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:09,006 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 [2025-03-04 16:18:09,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:09,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:09,008 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) [2025-03-04 16:18:09,009 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 [2025-03-04 16:18:09,010 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:09,010 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:09,020 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:09,021 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=2} Honda state: {fibo1_#in~n=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:09,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-04 16:18:09,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:09,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:09,028 INFO L229 MonitoredProcess]: Starting monitored process 40 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) [2025-03-04 16:18:09,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-04 16:18:09,029 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:09,029 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:09,040 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:09,040 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret5=0} Honda state: {fibo1_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:09,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-04 16:18:09,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:09,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:09,048 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) [2025-03-04 16:18:09,048 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 [2025-03-04 16:18:09,049 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:09,049 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:09,060 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:09,060 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret4=1} Honda state: {fibo1_#t~ret4=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:09,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-04 16:18:09,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:09,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:09,067 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) [2025-03-04 16:18:09,067 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 [2025-03-04 16:18:09,068 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:09,068 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:09,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-04 16:18:09,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:09,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:09,087 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) [2025-03-04 16:18:09,088 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 [2025-03-04 16:18:09,089 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:18:09,089 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:09,101 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:18:09,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-03-04 16:18:09,107 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:18:09,107 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:18:09,107 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:18:09,107 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:18:09,107 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:18:09,107 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:09,107 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:18:09,107 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:18:09,107 INFO L132 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5-1.c_Iteration5_Loop [2025-03-04 16:18:09,108 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:18:09,108 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:18:09,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:09,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:09,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:09,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:09,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:09,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:09,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:09,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:09,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:09,179 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:18:09,179 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:18:09,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:09,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:09,182 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) [2025-03-04 16:18:09,183 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 [2025-03-04 16:18:09,185 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 [2025-03-04 16:18:09,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:09,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:09,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:09,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:09,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:09,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:09,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:09,196 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:09,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-04 16:18:09,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:09,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:09,205 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) [2025-03-04 16:18:09,206 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 [2025-03-04 16:18:09,208 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 [2025-03-04 16:18:09,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:09,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:09,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:09,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:09,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:09,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:09,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:09,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:09,226 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 [2025-03-04 16:18:09,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:09,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:09,229 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) [2025-03-04 16:18:09,231 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 [2025-03-04 16:18:09,231 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 [2025-03-04 16:18:09,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:09,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:09,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:09,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:09,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:09,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:09,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:09,244 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:09,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-04 16:18:09,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:09,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:09,251 INFO L229 MonitoredProcess]: Starting monitored process 47 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) [2025-03-04 16:18:09,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-04 16:18:09,253 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 [2025-03-04 16:18:09,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:09,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:09,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:09,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:09,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:09,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:09,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:09,264 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:09,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-03-04 16:18:09,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:09,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:09,272 INFO L229 MonitoredProcess]: Starting monitored process 48 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) [2025-03-04 16:18:09,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-04 16:18:09,275 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 [2025-03-04 16:18:09,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:09,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:09,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:09,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:09,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:09,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:09,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:09,287 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:09,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-04 16:18:09,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:09,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:09,295 INFO L229 MonitoredProcess]: Starting monitored process 49 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) [2025-03-04 16:18:09,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-04 16:18:09,298 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 [2025-03-04 16:18:09,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:09,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:09,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:09,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:09,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:09,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:09,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:09,309 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:09,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-03-04 16:18:09,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:09,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:09,317 INFO L229 MonitoredProcess]: Starting monitored process 50 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) [2025-03-04 16:18:09,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-04 16:18:09,320 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 [2025-03-04 16:18:09,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:09,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:09,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:09,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:09,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:09,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:09,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:09,332 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:09,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-03-04 16:18:09,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:09,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:09,340 INFO L229 MonitoredProcess]: Starting monitored process 51 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) [2025-03-04 16:18:09,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-04 16:18:09,343 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 [2025-03-04 16:18:09,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:09,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:09,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:09,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:09,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:09,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:09,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:09,356 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:09,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-03-04 16:18:09,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:09,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:09,364 INFO L229 MonitoredProcess]: Starting monitored process 52 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) [2025-03-04 16:18:09,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-04 16:18:09,366 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 [2025-03-04 16:18:09,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:09,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:09,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:09,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:09,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:09,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:09,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:09,382 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:18:09,384 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 16:18:09,384 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:18:09,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:09,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:09,389 INFO L229 MonitoredProcess]: Starting monitored process 53 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) [2025-03-04 16:18:09,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-04 16:18:09,391 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:18:09,391 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:18:09,391 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:18:09,391 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2025-03-04 16:18:09,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-04 16:18:09,397 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:18:09,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:09,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 16:18:09,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 16:18:09,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:09,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:09,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 16:18:09,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:10,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:18:10,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:18:10,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:10,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:10,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 16:18:10,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:10,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:18:10,108 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2025-03-04 16:18:10,108 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 213 transitions. cyclomatic complexity: 55 Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 16:18:10,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-04 16:18:10,477 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 213 transitions. cyclomatic complexity: 55. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Result 912 states and 1216 transitions. Complement of second has 48 states. [2025-03-04 16:18:10,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2025-03-04 16:18:10,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 16:18:10,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2025-03-04 16:18:10,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 73 transitions. Stem has 85 letters. Loop has 14 letters. [2025-03-04 16:18:10,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:18:10,479 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:18:10,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:10,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 16:18:10,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 16:18:10,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:10,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:10,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 16:18:10,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:10,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:18:10,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:18:10,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:10,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:10,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 16:18:10,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:11,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:18:11,046 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2025-03-04 16:18:11,047 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 213 transitions. cyclomatic complexity: 55 Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 16:18:11,260 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 213 transitions. cyclomatic complexity: 55. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Result 693 states and 982 transitions. Complement of second has 30 states. [2025-03-04 16:18:11,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2025-03-04 16:18:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 16:18:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2025-03-04 16:18:11,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 50 transitions. Stem has 85 letters. Loop has 14 letters. [2025-03-04 16:18:11,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:18:11,263 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:18:11,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:11,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 16:18:11,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 16:18:11,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:11,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:11,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 16:18:11,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:11,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:18:11,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:18:11,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:11,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:11,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 16:18:11,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:18:11,811 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 8 loop predicates [2025-03-04 16:18:11,812 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 213 transitions. cyclomatic complexity: 55 Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 16:18:12,110 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 213 transitions. cyclomatic complexity: 55. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Result 1670 states and 2175 transitions. Complement of second has 147 states. [2025-03-04 16:18:12,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2025-03-04 16:18:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 16:18:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 77 transitions. [2025-03-04 16:18:12,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 77 transitions. Stem has 85 letters. Loop has 14 letters. [2025-03-04 16:18:12,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:18:12,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 77 transitions. Stem has 99 letters. Loop has 14 letters. [2025-03-04 16:18:12,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:18:12,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 77 transitions. Stem has 85 letters. Loop has 28 letters. [2025-03-04 16:18:12,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:18:12,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1670 states and 2175 transitions. [2025-03-04 16:18:12,130 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2025-03-04 16:18:12,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1670 states to 1206 states and 1670 transitions. [2025-03-04 16:18:12,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 351 [2025-03-04 16:18:12,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 377 [2025-03-04 16:18:12,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1206 states and 1670 transitions. [2025-03-04 16:18:12,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:18:12,149 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1206 states and 1670 transitions. [2025-03-04 16:18:12,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states and 1670 transitions. [2025-03-04 16:18:12,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1063. [2025-03-04 16:18:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 690 states have (on average 1.2115942028985507) internal successors, (836), 751 states have internal predecessors, (836), 203 states have call successors, (220), 142 states have call predecessors, (220), 170 states have return successors, (416), 169 states have call predecessors, (416), 200 states have call successors, (416) [2025-03-04 16:18:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1472 transitions. [2025-03-04 16:18:12,201 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1063 states and 1472 transitions. [2025-03-04 16:18:12,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:18:12,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 16:18:12,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-03-04 16:18:12,202 INFO L87 Difference]: Start difference. First operand 1063 states and 1472 transitions. Second operand has 20 states, 17 states have (on average 2.764705882352941) internal successors, (47), 16 states have internal predecessors, (47), 12 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (13), 5 states have call predecessors, (13), 9 states have call successors, (13) [2025-03-04 16:18:12,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:18:12,444 INFO L93 Difference]: Finished difference Result 1300 states and 1835 transitions. [2025-03-04 16:18:12,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1300 states and 1835 transitions. [2025-03-04 16:18:12,455 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 94 [2025-03-04 16:18:12,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1300 states to 645 states and 812 transitions. [2025-03-04 16:18:12,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 380 [2025-03-04 16:18:12,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 382 [2025-03-04 16:18:12,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 645 states and 812 transitions. [2025-03-04 16:18:12,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:18:12,462 INFO L218 hiAutomatonCegarLoop]: Abstraction has 645 states and 812 transitions. [2025-03-04 16:18:12,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states and 812 transitions. [2025-03-04 16:18:12,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 590. [2025-03-04 16:18:12,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 383 states have (on average 1.1879895561357703) internal successors, (455), 418 states have internal predecessors, (455), 113 states have call successors, (123), 81 states have call predecessors, (123), 94 states have return successors, (179), 90 states have call predecessors, (179), 101 states have call successors, (179) [2025-03-04 16:18:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 757 transitions. [2025-03-04 16:18:12,473 INFO L240 hiAutomatonCegarLoop]: Abstraction has 590 states and 757 transitions. [2025-03-04 16:18:12,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 16:18:12,474 INFO L432 stractBuchiCegarLoop]: Abstraction has 590 states and 757 transitions. [2025-03-04 16:18:12,474 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 16:18:12,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 757 transitions. [2025-03-04 16:18:12,477 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 92 [2025-03-04 16:18:12,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:18:12,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:18:12,478 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:18:12,478 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:18:12,478 INFO L752 eck$LassoCheckResult]: Stem: "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(18, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 5;" "call main_#t~ret8#1 := fibo1(main_~x~0#1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7;" "assume true;" >"#41#return;" [2025-03-04 16:18:12,478 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#35#return;" "#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7;" "assume true;" >"#41#return;" [2025-03-04 16:18:12,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:12,478 INFO L85 PathProgramCache]: Analyzing trace with hash -504148149, now seen corresponding path program 1 times [2025-03-04 16:18:12,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:12,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101523702] [2025-03-04 16:18:12,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:12,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:12,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 16:18:12,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 16:18:12,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:12,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:12,483 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:18:12,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 16:18:12,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 16:18:12,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:12,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:12,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:18:12,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:12,491 INFO L85 PathProgramCache]: Analyzing trace with hash 713867233, now seen corresponding path program 1 times [2025-03-04 16:18:12,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:12,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518639550] [2025-03-04 16:18:12,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:12,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:12,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 16:18:12,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 16:18:12,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:12,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 16:18:12,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:18:12,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518639550] [2025-03-04 16:18:12,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518639550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:18:12,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257291943] [2025-03-04 16:18:12,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:12,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:18:12,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:12,532 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:18:12,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2025-03-04 16:18:12,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 16:18:12,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 16:18:12,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:12,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:12,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 16:18:12,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 16:18:12,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:18:12,618 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 16:18:12,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257291943] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:18:12,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:18:12,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-03-04 16:18:12,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739711648] [2025-03-04 16:18:12,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:18:12,620 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:18:12,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:18:12,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 16:18:12,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 16:18:12,620 INFO L87 Difference]: Start difference. First operand 590 states and 757 transitions. cyclomatic complexity: 176 Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 16:18:12,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:18:12,682 INFO L93 Difference]: Finished difference Result 623 states and 771 transitions. [2025-03-04 16:18:12,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 623 states and 771 transitions. [2025-03-04 16:18:12,686 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 86 [2025-03-04 16:18:12,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 623 states to 613 states and 757 transitions. [2025-03-04 16:18:12,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 355 [2025-03-04 16:18:12,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 355 [2025-03-04 16:18:12,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 613 states and 757 transitions. [2025-03-04 16:18:12,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:18:12,690 INFO L218 hiAutomatonCegarLoop]: Abstraction has 613 states and 757 transitions. [2025-03-04 16:18:12,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states and 757 transitions. [2025-03-04 16:18:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 601. [2025-03-04 16:18:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 394 states have (on average 1.1649746192893402) internal successors, (459), 421 states have internal predecessors, (459), 113 states have call successors, (119), 89 states have call predecessors, (119), 94 states have return successors, (167), 90 states have call predecessors, (167), 101 states have call successors, (167) [2025-03-04 16:18:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 745 transitions. [2025-03-04 16:18:12,701 INFO L240 hiAutomatonCegarLoop]: Abstraction has 601 states and 745 transitions. [2025-03-04 16:18:12,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 16:18:12,702 INFO L432 stractBuchiCegarLoop]: Abstraction has 601 states and 745 transitions. [2025-03-04 16:18:12,702 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 16:18:12,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 601 states and 745 transitions. [2025-03-04 16:18:12,704 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 86 [2025-03-04 16:18:12,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:18:12,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:18:12,705 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:18:12,705 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:18:12,706 INFO L752 eck$LassoCheckResult]: Stem: "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(18, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 5;" "call main_#t~ret8#1 := fibo1(main_~x~0#1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7;" "assume true;" >"#41#return;" [2025-03-04 16:18:12,706 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#41#return;" "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#39#return;" "#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7;" "assume true;" >"#41#return;" [2025-03-04 16:18:12,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:12,706 INFO L85 PathProgramCache]: Analyzing trace with hash -504148149, now seen corresponding path program 2 times [2025-03-04 16:18:12,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:12,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359686714] [2025-03-04 16:18:12,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:18:12,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:12,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 16:18:12,715 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 16:18:12,715 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:18:12,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:12,715 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:18:12,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 16:18:12,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 16:18:12,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:12,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:12,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:18:12,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:12,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2001867403, now seen corresponding path program 1 times [2025-03-04 16:18:12,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:12,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220362859] [2025-03-04 16:18:12,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:12,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:12,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 16:18:12,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 16:18:12,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:12,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 16:18:12,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:18:12,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220362859] [2025-03-04 16:18:12,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220362859] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:18:12,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477659913] [2025-03-04 16:18:12,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:12,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:18:12,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:12,824 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:18:12,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-03-04 16:18:12,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 16:18:12,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 16:18:12,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:12,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:12,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 16:18:12,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 16:18:12,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:18:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 16:18:13,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477659913] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:18:13,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:18:13,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 15 [2025-03-04 16:18:13,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801298019] [2025-03-04 16:18:13,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:18:13,065 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:18:13,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:18:13,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 16:18:13,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-04 16:18:13,065 INFO L87 Difference]: Start difference. First operand 601 states and 745 transitions. cyclomatic complexity: 153 Second operand has 15 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-04 16:18:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:18:13,196 INFO L93 Difference]: Finished difference Result 393 states and 503 transitions. [2025-03-04 16:18:13,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 393 states and 503 transitions. [2025-03-04 16:18:13,199 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2025-03-04 16:18:13,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 393 states to 285 states and 349 transitions. [2025-03-04 16:18:13,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2025-03-04 16:18:13,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2025-03-04 16:18:13,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 349 transitions. [2025-03-04 16:18:13,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:18:13,202 INFO L218 hiAutomatonCegarLoop]: Abstraction has 285 states and 349 transitions. [2025-03-04 16:18:13,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 349 transitions. [2025-03-04 16:18:13,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 271. [2025-03-04 16:18:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 175 states have (on average 1.1314285714285715) internal successors, (198), 189 states have internal predecessors, (198), 55 states have call successors, (58), 39 states have call predecessors, (58), 41 states have return successors, (73), 42 states have call predecessors, (73), 46 states have call successors, (73) [2025-03-04 16:18:13,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 329 transitions. [2025-03-04 16:18:13,207 INFO L240 hiAutomatonCegarLoop]: Abstraction has 271 states and 329 transitions. [2025-03-04 16:18:13,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 16:18:13,209 INFO L432 stractBuchiCegarLoop]: Abstraction has 271 states and 329 transitions. [2025-03-04 16:18:13,209 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 16:18:13,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 329 transitions. [2025-03-04 16:18:13,211 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2025-03-04 16:18:13,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:18:13,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:18:13,211 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:18:13,211 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:18:13,211 INFO L752 eck$LassoCheckResult]: Stem: "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(18, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 5;" "call main_#t~ret8#1 := fibo1(main_~x~0#1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#41#return;" "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7;" "assume true;" >"#41#return;" "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" [2025-03-04 16:18:13,211 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#41#return;" "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" [2025-03-04 16:18:13,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:13,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1096709704, now seen corresponding path program 1 times [2025-03-04 16:18:13,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:13,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67046645] [2025-03-04 16:18:13,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:13,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:13,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 16:18:13,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 16:18:13,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:13,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 24 proven. 34 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 16:18:13,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:18:13,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67046645] [2025-03-04 16:18:13,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67046645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:18:13,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434733963] [2025-03-04 16:18:13,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:13,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:18:13,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:13,291 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:18:13,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2025-03-04 16:18:13,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 16:18:13,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 16:18:13,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:13,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:13,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 16:18:13,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 16:18:13,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:18:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 24 proven. 34 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 16:18:13,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434733963] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:18:13,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:18:13,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 12 [2025-03-04 16:18:13,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742173457] [2025-03-04 16:18:13,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:18:13,441 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:18:13,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:13,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2064868191, now seen corresponding path program 2 times [2025-03-04 16:18:13,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:13,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537426184] [2025-03-04 16:18:13,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:18:13,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:13,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 16:18:13,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:18:13,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:18:13,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:18:13,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:18:13,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537426184] [2025-03-04 16:18:13,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537426184] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:18:13,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113224643] [2025-03-04 16:18:13,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:18:13,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:18:13,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:13,483 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:18:13,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-03-04 16:18:13,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 16:18:13,510 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:18:13,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:18:13,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:13,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 16:18:13,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:13,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:18:13,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:18:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:18:13,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113224643] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:18:13,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:18:13,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-03-04 16:18:13,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399160102] [2025-03-04 16:18:13,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:18:13,567 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:18:13,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:18:13,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 16:18:13,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 16:18:13,568 INFO L87 Difference]: Start difference. First operand 271 states and 329 transitions. cyclomatic complexity: 63 Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 16:18:13,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:18:13,621 INFO L93 Difference]: Finished difference Result 218 states and 263 transitions. [2025-03-04 16:18:13,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 218 states and 263 transitions. [2025-03-04 16:18:13,623 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2025-03-04 16:18:13,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 218 states to 196 states and 239 transitions. [2025-03-04 16:18:13,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2025-03-04 16:18:13,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2025-03-04 16:18:13,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 239 transitions. [2025-03-04 16:18:13,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:18:13,624 INFO L218 hiAutomatonCegarLoop]: Abstraction has 196 states and 239 transitions. [2025-03-04 16:18:13,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 239 transitions. [2025-03-04 16:18:13,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 178. [2025-03-04 16:18:13,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 117 states have (on average 1.1196581196581197) internal successors, (131), 122 states have internal predecessors, (131), 34 states have call successors, (36), 26 states have call predecessors, (36), 27 states have return successors, (48), 29 states have call predecessors, (48), 30 states have call successors, (48) [2025-03-04 16:18:13,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 215 transitions. [2025-03-04 16:18:13,630 INFO L240 hiAutomatonCegarLoop]: Abstraction has 178 states and 215 transitions. [2025-03-04 16:18:13,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 16:18:13,632 INFO L432 stractBuchiCegarLoop]: Abstraction has 178 states and 215 transitions. [2025-03-04 16:18:13,632 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 16:18:13,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 215 transitions. [2025-03-04 16:18:13,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2025-03-04 16:18:13,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:18:13,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:18:13,634 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:18:13,635 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-04 16:18:13,635 INFO L752 eck$LassoCheckResult]: Stem: "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(18, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 5;" "call main_#t~ret8#1 := fibo1(main_~x~0#1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7;" "assume true;" >"#41#return;" [2025-03-04 16:18:13,635 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7;" "assume true;" >"#41#return;" "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#39#return;" "#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7;" "assume true;" >"#41#return;" [2025-03-04 16:18:13,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:13,635 INFO L85 PathProgramCache]: Analyzing trace with hash -504148149, now seen corresponding path program 3 times [2025-03-04 16:18:13,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:13,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712960180] [2025-03-04 16:18:13,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:18:13,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:13,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-03-04 16:18:13,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 16:18:13,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 16:18:13,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:13,643 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:18:13,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 16:18:13,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 16:18:13,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:13,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:13,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:18:13,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:13,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1083084421, now seen corresponding path program 1 times [2025-03-04 16:18:13,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:13,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333217734] [2025-03-04 16:18:13,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:13,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:13,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 16:18:13,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 16:18:13,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:13,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 23 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 16:18:13,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:18:13,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333217734] [2025-03-04 16:18:13,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333217734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:18:13,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409741793] [2025-03-04 16:18:13,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:13,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:18:13,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:13,742 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:18:13,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2025-03-04 16:18:13,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 16:18:13,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 16:18:13,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:13,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:13,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 16:18:13,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:13,811 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 59 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 16:18:13,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:18:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 21 proven. 33 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 16:18:14,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409741793] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:18:14,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:18:14,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-04 16:18:14,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138345184] [2025-03-04 16:18:14,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:18:14,007 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:18:14,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:18:14,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 16:18:14,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-04 16:18:14,007 INFO L87 Difference]: Start difference. First operand 178 states and 215 transitions. cyclomatic complexity: 40 Second operand has 15 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 7 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 16:18:14,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:18:14,116 INFO L93 Difference]: Finished difference Result 194 states and 226 transitions. [2025-03-04 16:18:14,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 226 transitions. [2025-03-04 16:18:14,117 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2025-03-04 16:18:14,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 182 states and 214 transitions. [2025-03-04 16:18:14,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2025-03-04 16:18:14,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2025-03-04 16:18:14,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 214 transitions. [2025-03-04 16:18:14,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:18:14,119 INFO L218 hiAutomatonCegarLoop]: Abstraction has 182 states and 214 transitions. [2025-03-04 16:18:14,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 214 transitions. [2025-03-04 16:18:14,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-03-04 16:18:14,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 121 states have (on average 1.0826446280991735) internal successors, (131), 124 states have internal predecessors, (131), 34 states have call successors, (36), 28 states have call predecessors, (36), 27 states have return successors, (47), 29 states have call predecessors, (47), 30 states have call successors, (47) [2025-03-04 16:18:14,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 214 transitions. [2025-03-04 16:18:14,122 INFO L240 hiAutomatonCegarLoop]: Abstraction has 182 states and 214 transitions. [2025-03-04 16:18:14,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 16:18:14,123 INFO L432 stractBuchiCegarLoop]: Abstraction has 182 states and 214 transitions. [2025-03-04 16:18:14,123 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 16:18:14,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 214 transitions. [2025-03-04 16:18:14,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2025-03-04 16:18:14,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:18:14,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:18:14,124 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:18:14,124 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-04 16:18:14,124 INFO L752 eck$LassoCheckResult]: Stem: "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(18, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 5;" "call main_#t~ret8#1 := fibo1(main_~x~0#1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7;" "assume true;" >"#41#return;" [2025-03-04 16:18:14,124 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7;" "assume true;" >"#41#return;" "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#39#return;" "#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7;" "assume true;" >"#41#return;" [2025-03-04 16:18:14,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:14,125 INFO L85 PathProgramCache]: Analyzing trace with hash -504148149, now seen corresponding path program 4 times [2025-03-04 16:18:14,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:14,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622534705] [2025-03-04 16:18:14,125 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:18:14,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:14,128 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-04 16:18:14,131 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 16:18:14,131 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:18:14,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:14,132 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:18:14,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 16:18:14,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 16:18:14,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:14,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:14,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:18:14,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:14,136 INFO L85 PathProgramCache]: Analyzing trace with hash -49899111, now seen corresponding path program 1 times [2025-03-04 16:18:14,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:14,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844698100] [2025-03-04 16:18:14,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:14,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:14,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 16:18:14,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 16:18:14,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:14,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:14,265 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 43 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 16:18:14,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:18:14,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844698100] [2025-03-04 16:18:14,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844698100] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:18:14,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390333055] [2025-03-04 16:18:14,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:18:14,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:18:14,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:14,268 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:18:14,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-03-04 16:18:14,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 16:18:14,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 16:18:14,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:14,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:14,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 16:18:14,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:14,371 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 20 proven. 46 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 16:18:14,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:18:14,649 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 20 proven. 48 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 16:18:14,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390333055] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:18:14,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:18:14,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 21 [2025-03-04 16:18:14,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237709927] [2025-03-04 16:18:14,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:18:14,650 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:18:14,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:18:14,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 16:18:14,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-03-04 16:18:14,651 INFO L87 Difference]: Start difference. First operand 182 states and 214 transitions. cyclomatic complexity: 35 Second operand has 22 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 13 states have call successors, (15), 2 states have call predecessors, (15), 6 states have return successors, (13), 6 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-04 16:18:14,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:18:14,965 INFO L93 Difference]: Finished difference Result 174 states and 192 transitions. [2025-03-04 16:18:14,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 192 transitions. [2025-03-04 16:18:14,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-04 16:18:14,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 82 states and 84 transitions. [2025-03-04 16:18:14,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2025-03-04 16:18:14,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2025-03-04 16:18:14,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 84 transitions. [2025-03-04 16:18:14,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:18:14,967 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 84 transitions. [2025-03-04 16:18:14,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 84 transitions. [2025-03-04 16:18:14,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2025-03-04 16:18:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 49 states have internal predecessors, (50), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 16:18:14,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2025-03-04 16:18:14,969 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 72 transitions. [2025-03-04 16:18:14,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 16:18:14,969 INFO L432 stractBuchiCegarLoop]: Abstraction has 70 states and 72 transitions. [2025-03-04 16:18:14,969 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 16:18:14,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 72 transitions. [2025-03-04 16:18:14,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-04 16:18:14,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:18:14,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:18:14,970 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 16:18:14,970 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:18:14,970 INFO L752 eck$LassoCheckResult]: Stem: "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(18, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 5;" "call main_#t~ret8#1 := fibo1(main_~x~0#1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7;" "assume true;" >"#41#return;" "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#39#return;" "#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#37#return;" "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#41#return;" "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume ~n < 1;#res := 0;" "assume true;" >"#39#return;" "#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#35#return;" "#res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7;" "assume true;" >"#41#return;" "call #t~ret5 := fibo2(~n - 2);"< [2025-03-04 16:18:14,970 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< [2025-03-04 16:18:14,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:14,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1229076001, now seen corresponding path program 2 times [2025-03-04 16:18:14,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:14,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226985311] [2025-03-04 16:18:14,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:18:14,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:14,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-04 16:18:14,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 16:18:14,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:18:14,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:14,978 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:18:14,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 16:18:14,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 16:18:14,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:14,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:14,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:18:14,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:14,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1078791395, now seen corresponding path program 2 times [2025-03-04 16:18:14,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:14,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319515995] [2025-03-04 16:18:14,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:18:14,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:14,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:18:14,987 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:18:14,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:18:14,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:14,987 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:18:14,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:18:14,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:18:14,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:14,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:14,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:18:14,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:14,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1209008389, now seen corresponding path program 3 times [2025-03-04 16:18:14,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:18:14,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819567554] [2025-03-04 16:18:14,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:18:14,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:18:14,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 5 equivalence classes. [2025-03-04 16:18:14,996 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 16:18:14,997 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 16:18:14,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:14,997 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:18:14,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 16:18:15,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 16:18:15,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:15,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:18:15,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:18:15,069 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:18:15,070 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:18:15,070 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:18:15,070 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:18:15,070 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:18:15,070 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:15,070 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:18:15,070 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:18:15,070 INFO L132 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5-1.c_Iteration11_Loop [2025-03-04 16:18:15,070 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:18:15,070 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:18:15,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:15,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:15,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:15,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:15,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:15,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:15,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:15,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:15,115 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:18:15,115 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:18:15,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:15,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:15,118 INFO L229 MonitoredProcess]: Starting monitored process 60 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) [2025-03-04 16:18:15,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-04 16:18:15,120 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:15,120 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:15,130 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:15,130 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:15,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-04 16:18:15,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:15,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:15,137 INFO L229 MonitoredProcess]: Starting monitored process 61 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) [2025-03-04 16:18:15,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-04 16:18:15,139 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:15,139 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:15,149 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:15,150 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:15,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-03-04 16:18:15,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:15,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:15,159 INFO L229 MonitoredProcess]: Starting monitored process 62 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) [2025-03-04 16:18:15,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-04 16:18:15,160 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:15,160 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:15,171 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:15,171 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret4=0} Honda state: {fibo1_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:15,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-04 16:18:15,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:15,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:15,179 INFO L229 MonitoredProcess]: Starting monitored process 63 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) [2025-03-04 16:18:15,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-04 16:18:15,180 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:15,180 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:15,190 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:15,190 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret5=0} Honda state: {fibo1_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:15,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-04 16:18:15,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:15,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:15,198 INFO L229 MonitoredProcess]: Starting monitored process 64 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) [2025-03-04 16:18:15,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-04 16:18:15,201 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:15,201 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:15,211 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:15,211 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret6=0} Honda state: {fibo2_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:15,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-04 16:18:15,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:15,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:15,219 INFO L229 MonitoredProcess]: Starting monitored process 65 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) [2025-03-04 16:18:15,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-04 16:18:15,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:15,220 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:15,230 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:18:15,230 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:18:15,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-04 16:18:15,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:15,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:15,237 INFO L229 MonitoredProcess]: Starting monitored process 66 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) [2025-03-04 16:18:15,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-04 16:18:15,239 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:18:15,239 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:15,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-04 16:18:15,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:15,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:15,257 INFO L229 MonitoredProcess]: Starting monitored process 67 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) [2025-03-04 16:18:15,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-04 16:18:15,259 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:18:15,259 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:18:15,299 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:18:15,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2025-03-04 16:18:15,303 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:18:15,303 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:18:15,303 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:18:15,303 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:18:15,303 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:18:15,303 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:15,303 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:18:15,303 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:18:15,303 INFO L132 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_5-1.c_Iteration11_Loop [2025-03-04 16:18:15,303 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:18:15,303 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:18:15,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:15,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:15,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:15,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:15,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:15,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:15,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:15,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:18:15,353 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:18:15,353 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:18:15,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:15,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:15,356 INFO L229 MonitoredProcess]: Starting monitored process 68 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) [2025-03-04 16:18:15,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-04 16:18:15,358 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 [2025-03-04 16:18:15,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:15,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:15,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:15,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:15,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:15,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:15,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:15,368 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:15,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2025-03-04 16:18:15,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:15,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:15,375 INFO L229 MonitoredProcess]: Starting monitored process 69 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) [2025-03-04 16:18:15,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-04 16:18:15,377 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 [2025-03-04 16:18:15,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:15,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:15,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:15,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:15,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:15,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:15,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:15,388 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:15,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-04 16:18:15,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:15,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:15,394 INFO L229 MonitoredProcess]: Starting monitored process 70 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) [2025-03-04 16:18:15,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-04 16:18:15,396 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 [2025-03-04 16:18:15,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:15,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:15,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:15,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:15,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:15,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:15,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:15,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:15,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-03-04 16:18:15,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:15,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:15,413 INFO L229 MonitoredProcess]: Starting monitored process 71 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) [2025-03-04 16:18:15,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-04 16:18:15,415 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 [2025-03-04 16:18:15,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:15,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:15,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:15,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:15,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:15,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:15,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:15,426 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:15,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-04 16:18:15,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:15,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:15,433 INFO L229 MonitoredProcess]: Starting monitored process 72 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) [2025-03-04 16:18:15,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-04 16:18:15,434 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 [2025-03-04 16:18:15,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:15,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:15,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:15,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:15,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:15,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:15,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:15,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:15,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-04 16:18:15,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:15,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:15,454 INFO L229 MonitoredProcess]: Starting monitored process 73 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) [2025-03-04 16:18:15,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-04 16:18:15,456 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 [2025-03-04 16:18:15,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:15,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:15,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:15,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:15,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:15,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:15,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:15,468 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:18:15,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-03-04 16:18:15,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:15,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:15,475 INFO L229 MonitoredProcess]: Starting monitored process 74 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) [2025-03-04 16:18:15,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-04 16:18:15,477 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 [2025-03-04 16:18:15,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:18:15,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:18:15,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:18:15,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:18:15,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:18:15,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:18:15,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:18:15,488 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:18:15,491 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 16:18:15,491 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:18:15,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:18:15,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:18:15,493 INFO L229 MonitoredProcess]: Starting monitored process 75 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) [2025-03-04 16:18:15,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-04 16:18:15,494 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:18:15,494 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:18:15,494 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:18:15,494 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_#in~n) = 1*fibo2_#in~n Supporting invariants [] [2025-03-04 16:18:15,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-04 16:18:15,500 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:18:15,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:15,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 16:18:15,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 16:18:15,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:15,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:15,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 16:18:15,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:15,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:18:15,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:18:15,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:15,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:15,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 16:18:15,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:18:15,870 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2025-03-04 16:18:15,870 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 72 transitions. cyclomatic complexity: 4 Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 16:18:15,917 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 72 transitions. cyclomatic complexity: 4. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 78 states and 79 transitions. Complement of second has 9 states. [2025-03-04 16:18:15,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 16:18:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 16:18:15,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2025-03-04 16:18:15,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 63 letters. Loop has 8 letters. [2025-03-04 16:18:15,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:18:15,919 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:18:15,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:15,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 16:18:15,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 16:18:15,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:15,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:15,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 16:18:15,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:16,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-03-04 16:18:16,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:18:16,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:18:16,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:16,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:16,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 16:18:16,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:18:16,315 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2025-03-04 16:18:16,315 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 72 transitions. cyclomatic complexity: 4 Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 16:18:16,354 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 72 transitions. cyclomatic complexity: 4. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 78 states and 79 transitions. Complement of second has 9 states. [2025-03-04 16:18:16,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 16:18:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 16:18:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2025-03-04 16:18:16,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 63 letters. Loop has 8 letters. [2025-03-04 16:18:16,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:18:16,355 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:18:16,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:18:16,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 16:18:16,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 16:18:16,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:16,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:16,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 16:18:16,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:16,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 16:18:16,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 16:18:16,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:18:16,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:18:16,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 16:18:16,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:18:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:18:16,726 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 6 loop predicates [2025-03-04 16:18:16,726 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 72 transitions. cyclomatic complexity: 4 Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 16:18:16,812 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 72 transitions. cyclomatic complexity: 4. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 91 states and 95 transitions. Complement of second has 23 states. [2025-03-04 16:18:16,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2025-03-04 16:18:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 16:18:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2025-03-04 16:18:16,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 63 letters. Loop has 8 letters. [2025-03-04 16:18:16,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:18:16,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 71 letters. Loop has 8 letters. [2025-03-04 16:18:16,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:18:16,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 63 letters. Loop has 16 letters. [2025-03-04 16:18:16,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:18:16,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 95 transitions. [2025-03-04 16:18:16,814 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:18:16,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 0 states and 0 transitions. [2025-03-04 16:18:16,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 16:18:16,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 16:18:16,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 16:18:16,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:18:16,815 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:18:16,815 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:18:16,815 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:18:16,815 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-04 16:18:16,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 16:18:16,815 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:18:16,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 16:18:16,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 04:18:16 BoogieIcfgContainer [2025-03-04 16:18:16,822 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 16:18:16,822 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 16:18:16,822 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 16:18:16,822 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 16:18:16,823 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:18:04" (3/4) ... [2025-03-04 16:18:16,824 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 16:18:16,825 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 16:18:16,825 INFO L158 Benchmark]: Toolchain (without parser) took 13221.14ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 110.8MB in the beginning and 165.5MB in the end (delta: -54.7MB). Peak memory consumption was 143.8MB. Max. memory is 16.1GB. [2025-03-04 16:18:16,825 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:18:16,825 INFO L158 Benchmark]: CACSL2BoogieTranslator took 148.64ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 101.0MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:18:16,825 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.90ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 100.0MB in the end (delta: 970.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:18:16,825 INFO L158 Benchmark]: Boogie Preprocessor took 25.51ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 99.0MB in the end (delta: 967.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:18:16,826 INFO L158 Benchmark]: IcfgBuilder took 197.35ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 88.0MB in the end (delta: 11.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 16:18:16,826 INFO L158 Benchmark]: BuchiAutomizer took 12820.61ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 88.0MB in the beginning and 169.1MB in the end (delta: -81.0MB). Peak memory consumption was 118.6MB. Max. memory is 16.1GB. [2025-03-04 16:18:16,826 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 343.9MB. Free memory was 169.1MB in the beginning and 165.5MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:18:16,828 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 148.64ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 101.0MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.90ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 100.0MB in the end (delta: 970.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.51ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 99.0MB in the end (delta: 967.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 197.35ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 88.0MB in the end (delta: 11.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 12820.61ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 88.0MB in the beginning and 169.1MB in the end (delta: -81.0MB). Peak memory consumption was 118.6MB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 343.9MB. Free memory was 169.1MB in the beginning and 165.5MB in the end (delta: 3.5MB). There was no memory consumed. 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 13 terminating modules (9 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 8 locations. One deterministic module has affine ranking function n and consists of 14 locations. One nondeterministic module has affine ranking function n and consists of 14 locations. One nondeterministic module has affine ranking function \old(n) and consists of 9 locations. 9 modules have a trivial ranking function, the largest among these consists of 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.7s and 12 iterations. TraceHistogramMax:8. Analysis of lassos took 6.3s. Construction of modules took 1.1s. Büchi inclusion checks took 5.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 12. Automata minimization 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 310 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 694 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 662 mSDsluCounter, 1549 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1146 mSDsCounter, 422 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2251 IncrementalHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 422 mSolverCounterUnsat, 403 mSDtfsCounter, 2251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT2 conc0 concLT0 SILN0 SILU0 SILI3 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp78 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq187 hnf91 smp78 dnf100 smp100 tf113 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 25 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 16:18:16,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2025-03-04 16:18:17,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2025-03-04 16:18:17,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2025-03-04 16:18:17,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2025-03-04 16:18:17,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2025-03-04 16:18:17,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2025-03-04 16:18:18,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-03-04 16:18:18,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-03-04 16:18:18,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 16:18:18,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE