./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive/McCarthy91-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed 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/McCarthy91-2.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 2a5dd5c1c64cd1875ba800cc2db6d1da955f2d2f519c1964ff87558bc42b9b4c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 07:32:02,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 07:32:02,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-09 07:32:02,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 07:32:02,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 07:32:02,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 07:32:02,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 07:32:02,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 07:32:02,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 07:32:02,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 07:32:02,639 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 07:32:02,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 07:32:02,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 07:32:02,639 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 07:32:02,640 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 07:32:02,640 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 07:32:02,640 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 07:32:02,640 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 07:32:02,640 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 07:32:02,640 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 07:32:02,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 07:32:02,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 07:32:02,640 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 07:32:02,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 07:32:02,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 07:32:02,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 07:32:02,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 07:32:02,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 07:32:02,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 07:32:02,641 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 07:32:02,641 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 07:32:02,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 07:32:02,641 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 07:32:02,641 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 07:32:02,641 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 07:32:02,641 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 07:32:02,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 07:32:02,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 07:32:02,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 07:32:02,642 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 07:32:02,642 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 -> 2a5dd5c1c64cd1875ba800cc2db6d1da955f2d2f519c1964ff87558bc42b9b4c [2025-03-09 07:32:02,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 07:32:02,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 07:32:02,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 07:32:02,888 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 07:32:02,888 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 07:32:02,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/McCarthy91-2.c [2025-03-09 07:32:03,995 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a439730/f1d1ae27c795498badc35d2cd5cd817a/FLAG7db243f55 [2025-03-09 07:32:04,221 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 07:32:04,221 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/McCarthy91-2.c [2025-03-09 07:32:04,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a439730/f1d1ae27c795498badc35d2cd5cd817a/FLAG7db243f55 [2025-03-09 07:32:04,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a439730/f1d1ae27c795498badc35d2cd5cd817a [2025-03-09 07:32:04,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 07:32:04,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 07:32:04,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 07:32:04,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 07:32:04,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 07:32:04,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:32:04" (1/1) ... [2025-03-09 07:32:04,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b59d556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:04, skipping insertion in model container [2025-03-09 07:32:04,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:32:04" (1/1) ... [2025-03-09 07:32:04,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 07:32:04,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:32:04,713 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 07:32:04,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:32:04,734 INFO L204 MainTranslator]: Completed translation [2025-03-09 07:32:04,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:04 WrapperNode [2025-03-09 07:32:04,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 07:32:04,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 07:32:04,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 07:32:04,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 07:32:04,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:04" (1/1) ... [2025-03-09 07:32:04,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:04" (1/1) ... [2025-03-09 07:32:04,755 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2025-03-09 07:32:04,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 07:32:04,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 07:32:04,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 07:32:04,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 07:32:04,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:04" (1/1) ... [2025-03-09 07:32:04,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:04" (1/1) ... [2025-03-09 07:32:04,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:04" (1/1) ... [2025-03-09 07:32:04,773 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-09 07:32:04,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:04" (1/1) ... [2025-03-09 07:32:04,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:04" (1/1) ... [2025-03-09 07:32:04,780 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:04" (1/1) ... [2025-03-09 07:32:04,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:04" (1/1) ... [2025-03-09 07:32:04,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:04" (1/1) ... [2025-03-09 07:32:04,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:04" (1/1) ... [2025-03-09 07:32:04,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 07:32:04,784 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 07:32:04,784 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 07:32:04,784 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 07:32:04,785 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:04" (1/1) ... [2025-03-09 07:32:04,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:04,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:04,812 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-09 07:32:04,816 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-09 07:32:04,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 07:32:04,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 07:32:04,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 07:32:04,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 07:32:04,838 INFO L130 BoogieDeclarations]: Found specification of procedure f91 [2025-03-09 07:32:04,838 INFO L138 BoogieDeclarations]: Found implementation of procedure f91 [2025-03-09 07:32:04,883 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 07:32:04,885 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 07:32:04,951 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21: havoc #t~ret4;havoc #t~ret5; [2025-03-09 07:32:04,961 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-03-09 07:32:04,961 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 07:32:04,971 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 07:32:04,971 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 07:32:04,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:32:04 BoogieIcfgContainer [2025-03-09 07:32:04,972 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 07:32:04,972 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 07:32:04,972 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 07:32:04,977 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 07:32:04,978 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:32:04,978 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 07:32:04" (1/3) ... [2025-03-09 07:32:04,979 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@691f2f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:32:04, skipping insertion in model container [2025-03-09 07:32:04,979 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:32:04,980 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:04" (2/3) ... [2025-03-09 07:32:04,980 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@691f2f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:32:04, skipping insertion in model container [2025-03-09 07:32:04,980 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:32:04,980 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:32:04" (3/3) ... [2025-03-09 07:32:04,981 INFO L363 chiAutomizerObserver]: Analyzing ICFG McCarthy91-2.c [2025-03-09 07:32:05,024 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 07:32:05,025 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 07:32:05,025 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 07:32:05,025 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 07:32:05,026 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 07:32:05,026 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 07:32:05,027 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 07:32:05,027 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 07:32:05,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 07:32:05,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 07:32:05,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:05,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:05,049 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-09 07:32:05,049 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:32:05,049 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 07:32:05,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 07:32:05,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 07:32:05,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:05,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:05,052 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-09 07:32:05,052 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:32:05,057 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(15, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "call main_#t~ret7#1 := f91(main_~x~0#1);"< [2025-03-09 07:32:05,057 INFO L754 eck$LassoCheckResult]: Loop: "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< [2025-03-09 07:32:05,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:05,063 INFO L85 PathProgramCache]: Analyzing trace with hash 38707, now seen corresponding path program 1 times [2025-03-09 07:32:05,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:05,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590515788] [2025-03-09 07:32:05,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:05,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:05,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:05,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:05,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:05,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:05,121 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:05,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:05,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:05,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:05,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:05,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:05,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:05,146 INFO L85 PathProgramCache]: Analyzing trace with hash 46647, now seen corresponding path program 1 times [2025-03-09 07:32:05,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:05,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133559781] [2025-03-09 07:32:05,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:05,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:05,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:05,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:05,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:05,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:05,157 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:05,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:05,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:05,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:05,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:05,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:05,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:05,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1153137093, now seen corresponding path program 1 times [2025-03-09 07:32:05,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:05,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275331938] [2025-03-09 07:32:05,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:05,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:05,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:32:05,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:32:05,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:05,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:05,179 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:05,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:32:05,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:32:05,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:05,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:05,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:05,273 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:05,274 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:05,274 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:05,274 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:05,274 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:32:05,275 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:05,275 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:05,275 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:05,275 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration1_Loop [2025-03-09 07:32:05,275 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:05,276 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:05,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:05,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:05,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:05,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:05,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:05,354 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:05,355 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:32:05,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:05,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:05,358 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-09 07:32:05,360 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-09 07:32:05,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:05,362 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:05,377 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:05,377 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:05,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:05,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:05,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:05,389 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-09 07:32:05,390 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-09 07:32:05,391 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:05,391 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:05,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-09 07:32:05,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:05,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:05,413 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-09 07:32:05,414 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-09 07:32:05,415 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:32:05,415 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:05,545 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:32:05,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-09 07:32:05,553 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:05,553 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:05,553 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:05,553 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:05,553 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:32:05,553 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:05,553 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:05,553 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:05,553 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration1_Loop [2025-03-09 07:32:05,553 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:05,553 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:05,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:05,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:05,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:05,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:05,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:05,605 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:05,609 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:32:05,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:05,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:05,614 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-09 07:32:05,616 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-09 07:32:05,617 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-09 07:32:05,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:05,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:05,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:05,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:05,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:05,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:05,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:05,640 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:05,646 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-09 07:32:05,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:05,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:05,649 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-09 07:32:05,652 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-09 07:32:05,653 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-09 07:32:05,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:05,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:05,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:05,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:05,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:05,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:05,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:05,672 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:32:05,674 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:32:05,676 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:32:05,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:05,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:05,680 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-09 07:32:05,683 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-09 07:32:05,685 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:32:05,685 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:32:05,685 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:32:05,686 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#in~x) = -2*f91_#in~x + 211 Supporting invariants [] [2025-03-09 07:32:05,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:05,695 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:32:05,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:05,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:05,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:05,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:05,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:05,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:32:05,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:05,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:05,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:05,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:05,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:05,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 07:32:05,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:05,811 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-09 07:32:05,830 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-09 07:32:05,831 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:32:05,924 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3). Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 43 transitions. Complement of second has 16 states. [2025-03-09 07:32:05,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-09 07:32:05,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:32:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2025-03-09 07:32:05,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 3 letters. Loop has 3 letters. [2025-03-09 07:32:05,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:05,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 6 letters. Loop has 3 letters. [2025-03-09 07:32:05,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:05,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 3 letters. Loop has 6 letters. [2025-03-09 07:32:05,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:05,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2025-03-09 07:32:05,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 07:32:05,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 19 states and 25 transitions. [2025-03-09 07:32:05,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-09 07:32:05,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-09 07:32:05,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2025-03-09 07:32:05,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:05,950 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-03-09 07:32:05,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2025-03-09 07:32:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2025-03-09 07:32:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 07:32:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-03-09 07:32:05,972 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-03-09 07:32:05,972 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-03-09 07:32:05,972 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 07:32:05,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2025-03-09 07:32:05,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 07:32:05,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:05,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:05,973 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:05,973 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:05,974 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(15, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "call main_#t~ret7#1 := f91(main_~x~0#1);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#24#return;" [2025-03-09 07:32:05,974 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret5 := f91(#t~ret4);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#24#return;" [2025-03-09 07:32:05,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:05,974 INFO L85 PathProgramCache]: Analyzing trace with hash 590804261, now seen corresponding path program 1 times [2025-03-09 07:32:05,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:05,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941352130] [2025-03-09 07:32:05,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:05,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:05,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:32:05,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:32:05,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:05,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:05,987 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:05,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:32:05,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:32:05,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:05,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:06,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:06,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:06,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1180657404, now seen corresponding path program 1 times [2025-03-09 07:32:06,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:06,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765347606] [2025-03-09 07:32:06,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:06,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:06,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:32:06,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:32:06,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:06,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:06,009 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:06,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:32:06,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:32:06,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:06,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:06,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:06,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:06,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1632490968, now seen corresponding path program 1 times [2025-03-09 07:32:06,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:06,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91347208] [2025-03-09 07:32:06,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:06,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:06,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 07:32:06,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 07:32:06,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:06,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:06,030 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:06,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 07:32:06,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 07:32:06,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:06,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:06,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:06,170 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:06,171 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:06,171 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:06,171 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:06,171 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:32:06,171 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:06,171 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:06,171 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:06,171 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration2_Loop [2025-03-09 07:32:06,171 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:06,171 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:06,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:06,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:06,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:06,222 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:06,222 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:32:06,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:06,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:06,226 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-09 07:32:06,227 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-09 07:32:06,228 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:06,228 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:06,239 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:06,239 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret5=0} Honda state: {f91_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:06,245 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-09 07:32:06,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:06,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:06,247 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-09 07:32:06,262 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:06,262 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:06,267 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-09 07:32:06,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:06,273 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:06,273 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:06,279 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-09 07:32:06,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:06,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:06,282 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-09 07:32:06,283 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-09 07:32:06,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:06,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:06,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-09 07:32:06,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:06,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:06,315 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-09 07:32:06,315 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-09 07:32:06,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:32:06,316 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:06,903 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:32:06,917 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-09 07:32:06,917 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:06,917 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:06,917 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:06,917 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:06,918 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:32:06,918 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:06,918 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:06,918 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:06,918 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration2_Loop [2025-03-09 07:32:06,918 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:06,918 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:06,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:06,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:06,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:06,964 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:06,964 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:32:06,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:06,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:06,968 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-09 07:32:06,969 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-09 07:32:06,971 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-09 07:32:06,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:06,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:06,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:06,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:06,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:06,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:06,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:06,988 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:32:06,991 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:32:06,991 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:32:06,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:06,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:06,993 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-09 07:32:06,995 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-09 07:32:06,996 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:32:06,996 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:32:06,996 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:32:06,996 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#t~ret4) = -2*f91_#t~ret4 + 201 Supporting invariants [] [2025-03-09 07:32:07,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:07,003 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:32:07,008 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~ret4 [2025-03-09 07:32:07,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:07,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:32:07,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:32:07,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:07,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:07,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 07:32:07,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:07,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:32:07,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:32:07,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:07,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:07,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 07:32:07,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:07,222 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2025-03-09 07:32:07,223 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 07:32:07,361 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Result 51 states and 73 transitions. Complement of second has 32 states. [2025-03-09 07:32:07,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2025-03-09 07:32:07,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 07:32:07,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2025-03-09 07:32:07,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 10 letters. Loop has 8 letters. [2025-03-09 07:32:07,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:07,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 8 letters. [2025-03-09 07:32:07,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:07,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 10 letters. Loop has 16 letters. [2025-03-09 07:32:07,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:07,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 73 transitions. [2025-03-09 07:32:07,367 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-09 07:32:07,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 42 states and 62 transitions. [2025-03-09 07:32:07,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-09 07:32:07,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-09 07:32:07,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 62 transitions. [2025-03-09 07:32:07,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:07,369 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 62 transitions. [2025-03-09 07:32:07,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 62 transitions. [2025-03-09 07:32:07,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2025-03-09 07:32:07,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-09 07:32:07,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2025-03-09 07:32:07,373 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 51 transitions. [2025-03-09 07:32:07,373 INFO L432 stractBuchiCegarLoop]: Abstraction has 36 states and 51 transitions. [2025-03-09 07:32:07,373 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 07:32:07,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 51 transitions. [2025-03-09 07:32:07,374 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-09 07:32:07,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:07,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:07,374 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:07,374 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:32:07,374 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(15, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "call main_#t~ret7#1 := f91(main_~x~0#1);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#24#return;" "call #t~ret5 := f91(#t~ret4);"< "~x := #in~x;" "assume !(~x > 100);" [2025-03-09 07:32:07,374 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume !(~x > 100);" [2025-03-09 07:32:07,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:07,375 INFO L85 PathProgramCache]: Analyzing trace with hash -126218833, now seen corresponding path program 2 times [2025-03-09 07:32:07,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:07,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709968819] [2025-03-09 07:32:07,375 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:32:07,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:07,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 07:32:07,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 07:32:07,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:32:07,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:07,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:07,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 07:32:07,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 07:32:07,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:07,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:07,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:07,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:07,396 INFO L85 PathProgramCache]: Analyzing trace with hash 52437, now seen corresponding path program 2 times [2025-03-09 07:32:07,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:07,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432990123] [2025-03-09 07:32:07,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:32:07,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:07,399 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:07,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:07,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:32:07,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:07,400 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:07,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:07,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:07,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:07,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:07,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:07,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:07,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2088847257, now seen corresponding path program 3 times [2025-03-09 07:32:07,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:07,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290838080] [2025-03-09 07:32:07,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:32:07,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:07,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 4 equivalence classes. [2025-03-09 07:32:07,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 07:32:07,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 07:32:07,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 07:32:07,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:32:07,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290838080] [2025-03-09 07:32:07,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290838080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:32:07,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:32:07,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 07:32:07,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412189415] [2025-03-09 07:32:07,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:32:07,633 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:07,633 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:07,633 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:07,633 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:07,633 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:32:07,633 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:07,633 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:07,633 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:07,633 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration3_Loop [2025-03-09 07:32:07,633 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:07,633 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:07,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:07,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:07,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:07,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:07,668 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:07,669 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:32:07,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:07,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:07,672 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-09 07:32:07,674 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-09 07:32:07,675 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:07,675 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:07,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:07,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:07,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:07,704 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-09 07:32:07,705 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-09 07:32:07,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:32:07,706 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:08,038 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:32:08,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-09 07:32:08,048 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:08,048 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:08,048 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:08,048 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:08,048 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:32:08,048 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:08,048 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:08,048 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:08,048 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration3_Loop [2025-03-09 07:32:08,048 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:08,048 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:08,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:08,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:08,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:08,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:08,083 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:08,083 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:32:08,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:08,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:08,085 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:08,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-09 07:32:08,088 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-09 07:32:08,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:08,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:08,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:08,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:08,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:08,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:08,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:08,106 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:08,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-09 07:32:08,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:08,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:08,114 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-09 07:32:08,115 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-09 07:32:08,116 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-09 07:32:08,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:08,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:08,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:08,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:08,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:08,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:08,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:08,128 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:32:08,130 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:32:08,130 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:32:08,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:08,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:08,132 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-09 07:32:08,133 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-09 07:32:08,134 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:32:08,134 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:32:08,134 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:32:08,134 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_~x) = -2*f91_~x + 189 Supporting invariants [] [2025-03-09 07:32:08,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:08,141 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:32:08,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:08,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 07:32:08,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 07:32:08,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:08,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:08,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 07:32:08,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:08,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:08,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:08,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:08,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:08,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 07:32:08,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:08,248 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-09 07:32:08,248 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-03-09 07:32:08,248 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 07:32:08,314 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 43 states and 59 transitions. Complement of second has 13 states. [2025-03-09 07:32:08,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-09 07:32:08,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 07:32:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2025-03-09 07:32:08,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-09 07:32:08,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:08,317 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:32:08,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:08,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 07:32:08,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-09 07:32:08,362 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-09 07:32:08,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 07:32:08,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:08,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:08,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 07:32:08,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:08,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:08,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:08,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:08,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:08,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 07:32:08,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:08,436 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-09 07:32:08,437 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2025-03-09 07:32:08,437 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 07:32:08,479 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 43 states and 59 transitions. Complement of second has 13 states. [2025-03-09 07:32:08,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-09 07:32:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 07:32:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2025-03-09 07:32:08,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-09 07:32:08,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:08,480 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:32:08,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:08,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 07:32:08,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 07:32:08,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:08,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:08,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 07:32:08,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:08,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:08,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:08,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:08,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:08,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 07:32:08,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:08,581 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-09 07:32:08,582 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-03-09 07:32:08,582 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 07:32:08,634 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 71 states and 100 transitions. Complement of second has 16 states. [2025-03-09 07:32:08,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-09 07:32:08,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 07:32:08,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2025-03-09 07:32:08,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-09 07:32:08,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:08,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 16 letters. Loop has 3 letters. [2025-03-09 07:32:08,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:08,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2025-03-09 07:32:08,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:08,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 100 transitions. [2025-03-09 07:32:08,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-03-09 07:32:08,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 48 states and 74 transitions. [2025-03-09 07:32:08,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-09 07:32:08,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-09 07:32:08,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 74 transitions. [2025-03-09 07:32:08,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:08,642 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 74 transitions. [2025-03-09 07:32:08,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 74 transitions. [2025-03-09 07:32:08,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2025-03-09 07:32:08,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (18), 9 states have call predecessors, (18), 5 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-09 07:32:08,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2025-03-09 07:32:08,645 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 60 transitions. [2025-03-09 07:32:08,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:32:08,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 07:32:08,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 07:32:08,647 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 07:32:08,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:32:08,715 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2025-03-09 07:32:08,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 82 transitions. [2025-03-09 07:32:08,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-09 07:32:08,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 58 states and 75 transitions. [2025-03-09 07:32:08,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2025-03-09 07:32:08,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-03-09 07:32:08,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 75 transitions. [2025-03-09 07:32:08,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:08,718 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 75 transitions. [2025-03-09 07:32:08,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 75 transitions. [2025-03-09 07:32:08,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2025-03-09 07:32:08,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 13 states have call successors, (18), 11 states have call predecessors, (18), 9 states have return successors, (19), 8 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-09 07:32:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2025-03-09 07:32:08,722 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 74 transitions. [2025-03-09 07:32:08,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 07:32:08,723 INFO L432 stractBuchiCegarLoop]: Abstraction has 57 states and 74 transitions. [2025-03-09 07:32:08,723 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 07:32:08,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 74 transitions. [2025-03-09 07:32:08,724 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-09 07:32:08,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:08,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:08,724 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 07:32:08,724 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1] [2025-03-09 07:32:08,725 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(15, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "call main_#t~ret7#1 := f91(main_~x~0#1);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#24#return;" "call #t~ret5 := f91(#t~ret4);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#22#return;" "#res := #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#24#return;" "call #t~ret5 := f91(#t~ret4);"< [2025-03-09 07:32:08,725 INFO L754 eck$LassoCheckResult]: Loop: "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#24#return;" "call #t~ret5 := f91(#t~ret4);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#22#return;" "#res := #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#24#return;" "call #t~ret5 := f91(#t~ret4);"< [2025-03-09 07:32:08,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:08,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1368746910, now seen corresponding path program 1 times [2025-03-09 07:32:08,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:08,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197113811] [2025-03-09 07:32:08,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:08,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:08,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 07:32:08,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 07:32:08,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:08,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:08,739 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:08,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 07:32:08,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 07:32:08,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:08,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:08,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:08,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:08,746 INFO L85 PathProgramCache]: Analyzing trace with hash -77812524, now seen corresponding path program 1 times [2025-03-09 07:32:08,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:08,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136994632] [2025-03-09 07:32:08,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:08,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:08,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:32:08,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:32:08,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:08,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:08,752 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:08,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:32:08,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:32:08,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:08,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:08,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:08,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1527524653, now seen corresponding path program 2 times [2025-03-09 07:32:08,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:08,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402602913] [2025-03-09 07:32:08,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:32:08,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:08,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-09 07:32:08,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 07:32:08,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:32:08,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-09 07:32:08,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:32:08,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402602913] [2025-03-09 07:32:08,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402602913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:32:08,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870049266] [2025-03-09 07:32:08,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:32:08,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:32:08,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:08,870 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:32:08,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 07:32:08,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-09 07:32:08,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 07:32:08,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:32:08,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:08,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 07:32:08,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:08,931 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-09 07:32:08,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:32:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-09 07:32:09,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870049266] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:32:09,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:32:09,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-09 07:32:09,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355863888] [2025-03-09 07:32:09,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:32:09,251 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:09,252 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:09,252 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:09,252 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:09,252 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:32:09,252 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:09,252 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:09,252 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:09,252 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration4_Loop [2025-03-09 07:32:09,252 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:09,252 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:09,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,279 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:09,279 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:32:09,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:09,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:09,281 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-09 07:32:09,282 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-09 07:32:09,283 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:09,283 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:09,305 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-09 07:32:09,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:09,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:09,306 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-09 07:32:09,307 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-09 07:32:09,308 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:32:09,308 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:09,319 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:32:09,325 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-09 07:32:09,325 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:09,325 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:09,325 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:09,325 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:09,325 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:32:09,325 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:09,325 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:09,325 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:09,325 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration4_Loop [2025-03-09 07:32:09,325 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:09,325 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:09,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,354 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:09,355 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:32:09,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:09,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:09,357 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-09 07:32:09,357 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-09 07:32:09,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-09 07:32:09,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:09,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:09,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:09,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:09,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:09,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:09,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:09,370 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:32:09,372 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:32:09,372 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:32:09,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:09,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:09,374 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-09 07:32:09,376 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-09 07:32:09,376 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:32:09,376 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:32:09,376 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:32:09,376 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#in~x) = -1*f91_#in~x + 90 Supporting invariants [] [2025-03-09 07:32:09,383 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-09 07:32:09,383 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:32:09,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:09,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 07:32:09,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 07:32:09,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:09,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:09,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 07:32:09,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:09,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:32:09,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:32:09,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:09,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:09,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 07:32:09,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 07:32:09,700 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2025-03-09 07:32:09,701 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21 Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-09 07:32:09,939 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Result 125 states and 150 transitions. Complement of second has 39 states. [2025-03-09 07:32:09,941 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-09 07:32:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-09 07:32:09,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2025-03-09 07:32:09,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 35 transitions. Stem has 22 letters. Loop has 19 letters. [2025-03-09 07:32:09,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:09,942 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:32:09,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:09,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 07:32:09,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 07:32:09,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:09,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:09,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 07:32:09,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:10,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:32:10,118 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-09 07:32:10,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:32:10,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:10,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:10,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 07:32:10,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 07:32:10,244 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2025-03-09 07:32:10,244 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21 Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-09 07:32:10,493 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Result 125 states and 150 transitions. Complement of second has 39 states. [2025-03-09 07:32:10,493 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-09 07:32:10,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-09 07:32:10,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2025-03-09 07:32:10,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 35 transitions. Stem has 22 letters. Loop has 19 letters. [2025-03-09 07:32:10,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:10,494 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:32:10,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:10,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 07:32:10,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 07:32:10,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:10,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:10,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 07:32:10,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:10,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:32:10,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:32:10,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:10,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:10,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 07:32:10,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:10,795 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 07:32:10,795 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 10 loop predicates [2025-03-09 07:32:10,796 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21 Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 07:32:11,293 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21. Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Result 431 states and 531 transitions. Complement of second has 224 states. [2025-03-09 07:32:11,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 2 stem states 18 non-accepting loop states 1 accepting loop states [2025-03-09 07:32:11,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 07:32:11,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 50 transitions. [2025-03-09 07:32:11,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 50 transitions. Stem has 22 letters. Loop has 19 letters. [2025-03-09 07:32:11,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:11,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 50 transitions. Stem has 41 letters. Loop has 19 letters. [2025-03-09 07:32:11,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:11,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 50 transitions. Stem has 22 letters. Loop has 38 letters. [2025-03-09 07:32:11,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:11,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 431 states and 531 transitions. [2025-03-09 07:32:11,303 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2025-03-09 07:32:11,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 431 states to 203 states and 269 transitions. [2025-03-09 07:32:11,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2025-03-09 07:32:11,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2025-03-09 07:32:11,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 203 states and 269 transitions. [2025-03-09 07:32:11,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:11,307 INFO L218 hiAutomatonCegarLoop]: Abstraction has 203 states and 269 transitions. [2025-03-09 07:32:11,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states and 269 transitions. [2025-03-09 07:32:11,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 157. [2025-03-09 07:32:11,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 97 states have (on average 1.092783505154639) internal successors, (106), 99 states have internal predecessors, (106), 35 states have call successors, (45), 29 states have call predecessors, (45), 25 states have return successors, (47), 28 states have call predecessors, (47), 32 states have call successors, (47) [2025-03-09 07:32:11,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2025-03-09 07:32:11,318 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 198 transitions. [2025-03-09 07:32:11,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:32:11,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 07:32:11,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-09 07:32:11,318 INFO L87 Difference]: Start difference. First operand 157 states and 198 transitions. Second operand has 15 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 8 states have internal predecessors, (22), 7 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 07:32:11,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:32:11,450 INFO L93 Difference]: Finished difference Result 159 states and 188 transitions. [2025-03-09 07:32:11,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 188 transitions. [2025-03-09 07:32:11,452 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-09 07:32:11,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 104 states and 123 transitions. [2025-03-09 07:32:11,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2025-03-09 07:32:11,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2025-03-09 07:32:11,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 123 transitions. [2025-03-09 07:32:11,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:11,454 INFO L218 hiAutomatonCegarLoop]: Abstraction has 104 states and 123 transitions. [2025-03-09 07:32:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 123 transitions. [2025-03-09 07:32:11,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2025-03-09 07:32:11,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 64 states have internal predecessors, (66), 21 states have call successors, (28), 20 states have call predecessors, (28), 16 states have return successors, (25), 15 states have call predecessors, (25), 18 states have call successors, (25) [2025-03-09 07:32:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2025-03-09 07:32:11,458 INFO L240 hiAutomatonCegarLoop]: Abstraction has 100 states and 119 transitions. [2025-03-09 07:32:11,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 07:32:11,460 INFO L432 stractBuchiCegarLoop]: Abstraction has 100 states and 119 transitions. [2025-03-09 07:32:11,460 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 07:32:11,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 119 transitions. [2025-03-09 07:32:11,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-09 07:32:11,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:11,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:11,461 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-09 07:32:11,461 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:11,461 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(15, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "call main_#t~ret7#1 := f91(main_~x~0#1);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#24#return;" "call #t~ret5 := f91(#t~ret4);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#22#return;" "#res := #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#24#return;" "call #t~ret5 := f91(#t~ret4);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#24#return;" [2025-03-09 07:32:11,461 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret5 := f91(#t~ret4);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#24#return;" [2025-03-09 07:32:11,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:11,461 INFO L85 PathProgramCache]: Analyzing trace with hash -619448126, now seen corresponding path program 3 times [2025-03-09 07:32:11,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:11,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735927426] [2025-03-09 07:32:11,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:32:11,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:11,465 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 7 equivalence classes. [2025-03-09 07:32:11,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 27 of 32 statements. [2025-03-09 07:32:11,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 07:32:11,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:11,559 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 07:32:11,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:32:11,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735927426] [2025-03-09 07:32:11,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735927426] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:32:11,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953813588] [2025-03-09 07:32:11,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:32:11,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:32:11,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,561 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-09 07:32:11,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 7 equivalence classes. [2025-03-09 07:32:11,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 27 of 32 statements. [2025-03-09 07:32:11,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 07:32:11,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:11,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 07:32:11,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 07:32:11,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 07:32:11,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953813588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:32:11,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 07:32:11,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 9 [2025-03-09 07:32:11,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047553734] [2025-03-09 07:32:11,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:32:11,602 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:32:11,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:11,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1180657404, now seen corresponding path program 2 times [2025-03-09 07:32:11,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:11,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989968973] [2025-03-09 07:32:11,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:32:11,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:11,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-09 07:32:11,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:32:11,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:32:11,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:11,606 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:11,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:32:11,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:32:11,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:11,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:11,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:11,675 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:11,676 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:11,676 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:11,676 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:11,676 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:32:11,676 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,676 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:11,676 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:11,676 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration5_Loop [2025-03-09 07:32:11,676 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:11,676 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:11,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,714 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:11,714 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:32:11,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,716 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-09 07:32:11,718 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-09 07:32:11,719 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:11,719 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:11,730 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:11,730 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:11,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:11,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,737 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-09 07:32:11,737 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-09 07:32:11,739 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:11,739 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:11,768 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-09 07:32:11,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,770 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-09 07:32:11,770 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-09 07:32:11,772 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:32:11,772 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:12,255 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:32:12,270 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-09 07:32:12,270 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:12,270 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:12,270 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:12,270 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:12,270 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:32:12,270 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,270 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:12,270 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:12,270 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration5_Loop [2025-03-09 07:32:12,271 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:12,271 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:12,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,297 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:12,297 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:32:12,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,299 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-09 07:32:12,300 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-09 07:32:12,301 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-09 07:32:12,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:12,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:12,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:12,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:12,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:12,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:12,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:12,312 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:12,318 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-09 07:32:12,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,319 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-09 07:32:12,320 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-09 07:32:12,321 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-09 07:32:12,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:12,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:12,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:12,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:12,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:12,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:12,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:12,332 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:12,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:12,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,339 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-09 07:32:12,340 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-09 07:32:12,341 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-09 07:32:12,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:12,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:12,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:12,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:12,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:12,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:12,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:12,354 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:32:12,355 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:32:12,356 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:32:12,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,357 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-09 07:32:12,358 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-09 07:32:12,359 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:32:12,359 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:32:12,359 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:32:12,359 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#t~ret4) = -2*f91_#t~ret4 + 201 Supporting invariants [] [2025-03-09 07:32:12,365 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-09 07:32:12,365 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:32:12,366 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~ret4 [2025-03-09 07:32:12,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:12,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 07:32:12,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 07:32:12,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:12,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:12,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 07:32:12,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:12,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:32:12,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:32:12,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:12,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:12,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 07:32:12,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:12,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:12,590 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2025-03-09 07:32:12,590 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24 Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 07:32:12,680 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 139 states and 161 transitions. Complement of second has 24 states. [2025-03-09 07:32:12,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2025-03-09 07:32:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 07:32:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2025-03-09 07:32:12,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 32 letters. Loop has 8 letters. [2025-03-09 07:32:12,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:12,684 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:32:12,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:12,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 07:32:12,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 07:32:12,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:12,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:12,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 07:32:12,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:12,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:32:12,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:32:12,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:12,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:12,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 07:32:12,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:12,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-09 07:32:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:12,925 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2025-03-09 07:32:12,925 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24 Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 07:32:13,019 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 139 states and 161 transitions. Complement of second has 24 states. [2025-03-09 07:32:13,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2025-03-09 07:32:13,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 07:32:13,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2025-03-09 07:32:13,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 32 letters. Loop has 8 letters. [2025-03-09 07:32:13,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:13,021 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:32:13,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:13,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 07:32:13,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 07:32:13,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:13,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:13,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 07:32:13,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:13,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:32:13,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:32:13,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:13,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:13,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 07:32:13,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:13,255 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2025-03-09 07:32:13,255 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24 Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 07:32:13,362 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 181 states and 211 transitions. Complement of second has 27 states. [2025-03-09 07:32:13,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2025-03-09 07:32:13,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 07:32:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2025-03-09 07:32:13,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 32 letters. Loop has 8 letters. [2025-03-09 07:32:13,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:13,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 40 letters. Loop has 8 letters. [2025-03-09 07:32:13,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:13,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 32 letters. Loop has 16 letters. [2025-03-09 07:32:13,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:13,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 211 transitions. [2025-03-09 07:32:13,368 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 07:32:13,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 0 states and 0 transitions. [2025-03-09 07:32:13,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 07:32:13,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 07:32:13,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 07:32:13,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:32:13,368 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:32:13,368 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:32:13,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:32:13,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 07:32:13,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 07:32:13,370 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 5 states have internal predecessors, (16), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 07:32:13,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:32:13,370 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-03-09 07:32:13,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-03-09 07:32:13,370 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 07:32:13,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 07:32:13,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 07:32:13,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 07:32:13,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 07:32:13,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:32:13,370 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:32:13,370 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:32:13,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 07:32:13,370 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:32:13,370 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 07:32:13,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 07:32:13,371 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 07:32:13,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 07:32:13,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 07:32:13 BoogieIcfgContainer [2025-03-09 07:32:13,376 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 07:32:13,377 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 07:32:13,377 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 07:32:13,377 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 07:32:13,378 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:32:04" (3/4) ... [2025-03-09 07:32:13,379 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 07:32:13,380 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 07:32:13,380 INFO L158 Benchmark]: Toolchain (without parser) took 8804.51ms. Allocated memory is still 167.8MB. Free memory was 130.9MB in the beginning and 72.8MB in the end (delta: 58.2MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. [2025-03-09 07:32:13,380 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 226.5MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:32:13,381 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.60ms. Allocated memory is still 167.8MB. Free memory was 130.4MB in the beginning and 120.3MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:32:13,381 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.38ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 119.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:32:13,381 INFO L158 Benchmark]: Boogie Preprocessor took 25.28ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 118.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:32:13,381 INFO L158 Benchmark]: IcfgBuilder took 187.89ms. Allocated memory is still 167.8MB. Free memory was 118.3MB in the beginning and 108.1MB in the end (delta: 10.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 07:32:13,381 INFO L158 Benchmark]: BuchiAutomizer took 8404.00ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 72.8MB in the end (delta: 35.3MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2025-03-09 07:32:13,381 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 167.8MB. Free memory was 72.8MB in the beginning and 72.8MB in the end (delta: 33.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:32:13,382 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.23ms. Allocated memory is still 226.5MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 158.60ms. Allocated memory is still 167.8MB. Free memory was 130.4MB in the beginning and 120.3MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.38ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 119.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.28ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 118.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 187.89ms. Allocated memory is still 167.8MB. Free memory was 118.3MB in the beginning and 108.1MB in the end (delta: 10.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 8404.00ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 72.8MB in the end (delta: 35.3MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 167.8MB. Free memory was 72.8MB in the beginning and 72.8MB in the end (delta: 33.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~ret4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~ret4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 2 deterministic, 3 nondeterministic). One deterministic module has affine ranking function (211 + ((long long) -2 * \old(x))) and consists of 5 locations. One deterministic module has affine ranking function null and consists of 8 locations. One nondeterministic module has affine ranking function (((long long) -2 * x) + 189) and consists of 6 locations. One nondeterministic module has affine ranking function (((long long) -1 * \old(x)) + 90) and consists of 21 locations. One nondeterministic module has affine ranking function null and consists of 8 locations. 3 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 6 iterations. TraceHistogramMax:7. Analysis of lassos took 4.0s. Construction of modules took 0.5s. Büchi inclusion checks took 3.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 65 StatesRemovedByMinimization, 6 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, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/24 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 247 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 234 mSDsluCounter, 411 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 239 mSDsCounter, 197 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 837 IncrementalHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 197 mSolverCounterUnsat, 172 mSDtfsCounter, 837 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq176 hnf90 smp100 dnf100 smp100 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.7s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-09 07:32:13,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-09 07:32:13,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-09 07:32:13,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE