./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-simple/nested_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-simple/nested_2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 d28004f57c6988e792d07d7254dfd532aeffd19f38063d85c3bfa2c0f504914f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:35:42,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:35:42,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:35:42,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:35:42,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:35:43,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:35:43,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:35:43,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:35:43,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:35:43,024 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:35:43,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:35:43,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:35:43,025 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:35:43,026 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:35:43,026 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:35:43,026 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:35:43,026 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:35:43,026 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:35:43,026 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:35:43,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:35:43,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:35:43,027 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:35:43,027 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:35:43,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:35:43,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:35:43,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:35:43,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:35:43,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:35:43,028 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:35:43,028 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:35:43,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:35:43,028 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:35:43,028 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:35:43,029 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:35:43,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:35:43,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:35:43,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:35:43,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:35:43,030 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:35:43,030 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-jdk21/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 -> d28004f57c6988e792d07d7254dfd532aeffd19f38063d85c3bfa2c0f504914f [2025-01-10 07:35:43,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:35:43,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:35:43,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:35:43,304 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:35:43,305 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:35:43,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_2.c [2025-01-10 07:35:44,542 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c771c012/53fb21fbd3834a2fb58c3a8bc9233724/FLAG620ef18f2 [2025-01-10 07:35:44,812 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:35:44,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_2.c [2025-01-10 07:35:44,820 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c771c012/53fb21fbd3834a2fb58c3a8bc9233724/FLAG620ef18f2 [2025-01-10 07:35:45,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c771c012/53fb21fbd3834a2fb58c3a8bc9233724 [2025-01-10 07:35:45,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:35:45,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:35:45,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:35:45,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:35:45,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:35:45,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:35:45" (1/1) ... [2025-01-10 07:35:45,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7382e96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:45, skipping insertion in model container [2025-01-10 07:35:45,129 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:35:45" (1/1) ... [2025-01-10 07:35:45,142 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:35:45,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:35:45,260 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:35:45,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:35:45,283 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:35:45,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:45 WrapperNode [2025-01-10 07:35:45,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:35:45,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:35:45,285 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:35:45,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:35:45,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:45" (1/1) ... [2025-01-10 07:35:45,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:45" (1/1) ... [2025-01-10 07:35:45,313 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 26 [2025-01-10 07:35:45,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:35:45,313 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:35:45,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:35:45,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:35:45,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:45" (1/1) ... [2025-01-10 07:35:45,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:45" (1/1) ... [2025-01-10 07:35:45,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:45" (1/1) ... [2025-01-10 07:35:45,332 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-01-10 07:35:45,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:45" (1/1) ... [2025-01-10 07:35:45,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:45" (1/1) ... [2025-01-10 07:35:45,335 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:45" (1/1) ... [2025-01-10 07:35:45,339 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:45" (1/1) ... [2025-01-10 07:35:45,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:45" (1/1) ... [2025-01-10 07:35:45,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:45" (1/1) ... [2025-01-10 07:35:45,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:45" (1/1) ... [2025-01-10 07:35:45,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:35:45,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:35:45,347 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:35:45,347 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:35:45,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:45" (1/1) ... [2025-01-10 07:35:45,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:45,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:45,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:45,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:35:45,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:35:45,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:35:45,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:35:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:35:45,458 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:35:45,459 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:35:45,541 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-01-10 07:35:45,541 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:35:45,550 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:35:45,550 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:35:45,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:35:45 BoogieIcfgContainer [2025-01-10 07:35:45,551 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:35:45,552 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:35:45,552 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:35:45,557 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:35:45,558 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:35:45,559 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:35:45" (1/3) ... [2025-01-10 07:35:45,560 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1eb916b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:35:45, skipping insertion in model container [2025-01-10 07:35:45,560 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:35:45,561 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:45" (2/3) ... [2025-01-10 07:35:45,561 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1eb916b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:35:45, skipping insertion in model container [2025-01-10 07:35:45,561 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:35:45,561 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:35:45" (3/3) ... [2025-01-10 07:35:45,563 INFO L363 chiAutomizerObserver]: Analyzing ICFG nested_2.c [2025-01-10 07:35:45,615 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:35:45,615 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:35:45,616 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:35:45,616 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:35:45,616 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:35:45,616 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:35:45,617 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:35:45,617 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:35:45,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:45,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:35:45,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:35:45,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:35:45,641 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:35:45,641 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:35:45,641 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:35:45,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:45,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:35:45,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:35:45,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:35:45,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:35:45,643 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:35:45,649 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0;" [2025-01-10 07:35:45,649 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume !(main_~b~0#1 < 6);main_#t~pre5#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre5#1;" [2025-01-10 07:35:45,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:45,655 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:35:45,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:45,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165067582] [2025-01-10 07:35:45,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:45,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:45,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:35:45,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:35:45,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:45,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:45,741 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:45,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:35:45,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:35:45,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:45,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:45,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:45,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:45,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1159, now seen corresponding path program 1 times [2025-01-10 07:35:45,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:45,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056844710] [2025-01-10 07:35:45,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:45,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:45,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:35:45,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:35:45,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:45,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:45,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:45,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:35:45,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056844710] [2025-01-10 07:35:45,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056844710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:35:45,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:35:45,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 07:35:45,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700854913] [2025-01-10 07:35:45,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:35:45,847 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:35:45,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:35:45,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:35:45,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:35:45,872 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:35:45,887 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2025-01-10 07:35:45,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2025-01-10 07:35:45,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:35:45,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 5 states and 6 transitions. [2025-01-10 07:35:45,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-01-10 07:35:45,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-01-10 07:35:45,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2025-01-10 07:35:45,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:35:45,900 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5 states and 6 transitions. [2025-01-10 07:35:45,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2025-01-10 07:35:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2025-01-10 07:35:45,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:45,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2025-01-10 07:35:45,923 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5 states and 6 transitions. [2025-01-10 07:35:45,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:35:45,927 INFO L432 stractBuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2025-01-10 07:35:45,927 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:35:45,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2025-01-10 07:35:45,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:35:45,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:35:45,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:35:45,928 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:35:45,928 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:35:45,928 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0;" [2025-01-10 07:35:45,929 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume !(main_~b~0#1 < 6);main_#t~pre5#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre5#1;" [2025-01-10 07:35:45,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:45,929 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2025-01-10 07:35:45,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:45,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613799729] [2025-01-10 07:35:45,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:35:45,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:45,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:35:45,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:35:45,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:35:45,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:45,937 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:45,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:35:45,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:35:45,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:45,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:45,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:45,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:45,950 INFO L85 PathProgramCache]: Analyzing trace with hash 35879, now seen corresponding path program 1 times [2025-01-10 07:35:45,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:45,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812595141] [2025-01-10 07:35:45,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:45,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:45,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:35:45,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:35:45,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:45,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:45,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:35:45,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812595141] [2025-01-10 07:35:45,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812595141] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:35:45,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954834567] [2025-01-10 07:35:45,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:45,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:35:45,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:45,990 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:35:45,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 07:35:46,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:35:46,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:35:46,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:46,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:46,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 07:35:46,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:46,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:46,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:35:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:46,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954834567] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:35:46,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:35:46,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-01-10 07:35:46,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100073672] [2025-01-10 07:35:46,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:35:46,091 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:35:46,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:35:46,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:35:46,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:35:46,092 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:46,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:35:46,111 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2025-01-10 07:35:46,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2025-01-10 07:35:46,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 07:35:46,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. [2025-01-10 07:35:46,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-01-10 07:35:46,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:35:46,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2025-01-10 07:35:46,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:35:46,113 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-01-10 07:35:46,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2025-01-10 07:35:46,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-01-10 07:35:46,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:46,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2025-01-10 07:35:46,114 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-01-10 07:35:46,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:35:46,115 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-01-10 07:35:46,115 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:35:46,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2025-01-10 07:35:46,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 07:35:46,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:35:46,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:35:46,116 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:35:46,116 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 1, 1] [2025-01-10 07:35:46,116 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0;" [2025-01-10 07:35:46,116 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume !(main_~b~0#1 < 6);main_#t~pre5#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre5#1;" [2025-01-10 07:35:46,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:46,117 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2025-01-10 07:35:46,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:46,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542513544] [2025-01-10 07:35:46,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:35:46,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:46,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:35:46,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:35:46,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:35:46,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:46,126 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:46,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:35:46,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:35:46,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:46,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:46,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:46,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:46,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1068821639, now seen corresponding path program 2 times [2025-01-10 07:35:46,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:46,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890577703] [2025-01-10 07:35:46,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:35:46,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:46,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-01-10 07:35:46,143 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:35:46,143 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:35:46,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:46,220 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:46,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:35:46,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890577703] [2025-01-10 07:35:46,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890577703] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:35:46,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692093527] [2025-01-10 07:35:46,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:35:46,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:35:46,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:46,226 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:35:46,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 07:35:46,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-01-10 07:35:46,256 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:35:46,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:35:46,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:46,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:35:46,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:46,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:46,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:35:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:46,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692093527] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:35:46,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:35:46,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-01-10 07:35:46,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475425925] [2025-01-10 07:35:46,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:35:46,344 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:35:46,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:35:46,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 07:35:46,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-10 07:35:46,345 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:46,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:35:46,358 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2025-01-10 07:35:46,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2025-01-10 07:35:46,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-01-10 07:35:46,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2025-01-10 07:35:46,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 07:35:46,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:35:46,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2025-01-10 07:35:46,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:35:46,360 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-01-10 07:35:46,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2025-01-10 07:35:46,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-01-10 07:35:46,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:46,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2025-01-10 07:35:46,361 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-01-10 07:35:46,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 07:35:46,363 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-01-10 07:35:46,363 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:35:46,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2025-01-10 07:35:46,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-01-10 07:35:46,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:35:46,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:35:46,364 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:35:46,364 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 1, 1] [2025-01-10 07:35:46,364 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0;" [2025-01-10 07:35:46,364 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume !(main_~b~0#1 < 6);main_#t~pre5#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre5#1;" [2025-01-10 07:35:46,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:46,365 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2025-01-10 07:35:46,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:46,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769365976] [2025-01-10 07:35:46,365 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:35:46,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:46,371 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-01-10 07:35:46,378 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:35:46,381 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:35:46,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:46,382 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:46,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:35:46,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:35:46,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:46,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:46,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:46,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:46,392 INFO L85 PathProgramCache]: Analyzing trace with hash 640409735, now seen corresponding path program 3 times [2025-01-10 07:35:46,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:46,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441240290] [2025-01-10 07:35:46,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:35:46,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:46,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 4 equivalence classes. [2025-01-10 07:35:46,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:35:46,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 07:35:46,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:46,406 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:46,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:35:46,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:35:46,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:46,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:46,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:46,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:46,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1330971209, now seen corresponding path program 1 times [2025-01-10 07:35:46,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:46,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517272788] [2025-01-10 07:35:46,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:46,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:46,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:35:46,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:35:46,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:46,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:46,444 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:46,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:35:46,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:35:46,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:46,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:46,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:46,567 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:35:46,567 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:35:46,568 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:35:46,568 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:35:46,568 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:35:46,568 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:46,568 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:35:46,568 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:35:46,569 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration4_Loop [2025-01-10 07:35:46,569 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:35:46,569 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:35:46,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:46,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:46,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:46,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:46,637 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:35:46,638 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:35:46,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:46,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:46,643 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:46,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:35:46,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:35:46,647 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:35:46,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-01-10 07:35:46,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:46,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:46,678 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:46,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:35:46,682 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:35:46,682 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:35:46,715 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:35:46,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-01-10 07:35:46,719 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:35:46,719 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:35:46,719 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:35:46,719 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:35:46,719 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:35:46,719 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:46,719 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:35:46,719 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:35:46,719 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration4_Loop [2025-01-10 07:35:46,719 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:35:46,719 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:35:46,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:46,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:46,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:46,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:46,776 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:35:46,780 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:35:46,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:46,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:46,785 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:46,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:35:46,788 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-01-10 07:35:46,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:35:46,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:35:46,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:35:46,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:35:46,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:35:46,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:35:46,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:35:46,808 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:35:46,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-01-10 07:35:46,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:46,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:46,819 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:46,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:35:46,823 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-01-10 07:35:46,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:35:46,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:35:46,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:35:46,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:35:46,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:35:46,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:35:46,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:35:46,839 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:35:46,842 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:35:46,845 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:35:46,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:46,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:46,850 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:46,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:35:46,853 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:35:46,853 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:35:46,853 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:35:46,854 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0#1) = -2*ULTIMATE.start_main_~a~0#1 + 11 Supporting invariants [] [2025-01-10 07:35:46,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-01-10 07:35:46,865 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:35:46,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:46,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:35:46,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:35:46,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:46,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:46,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:35:46,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:46,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:35:46,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:35:46,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:46,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:46,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:35:46,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:46,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-01-10 07:35:46,982 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 07:35:46,985 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 07:35:46,986 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:47,024 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 21 transitions. Complement of second has 4 states. [2025-01-10 07:35:47,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:35:47,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:47,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-01-10 07:35:47,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 8 letters. [2025-01-10 07:35:47,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:47,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 8 letters. [2025-01-10 07:35:47,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:47,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 16 letters. [2025-01-10 07:35:47,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:47,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2025-01-10 07:35:47,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-01-10 07:35:47,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2025-01-10 07:35:47,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-01-10 07:35:47,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:35:47,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2025-01-10 07:35:47,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:35:47,035 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-01-10 07:35:47,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2025-01-10 07:35:47,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2025-01-10 07:35:47,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2025-01-10 07:35:47,036 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2025-01-10 07:35:47,036 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2025-01-10 07:35:47,036 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:35:47,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2025-01-10 07:35:47,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-01-10 07:35:47,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:35:47,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:35:47,037 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:35:47,037 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:35:47,037 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0;" "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" [2025-01-10 07:35:47,037 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" [2025-01-10 07:35:47,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:47,037 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2025-01-10 07:35:47,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:47,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005950954] [2025-01-10 07:35:47,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:47,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:47,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:35:47,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:35:47,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:47,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:47,043 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:47,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:35:47,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:35:47,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:47,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:47,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:47,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:47,047 INFO L85 PathProgramCache]: Analyzing trace with hash 41, now seen corresponding path program 1 times [2025-01-10 07:35:47,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:47,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447309707] [2025-01-10 07:35:47,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:47,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:47,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:47,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:47,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:47,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:47,050 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:47,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:47,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:47,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:47,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:47,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:47,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:47,057 INFO L85 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2025-01-10 07:35:47,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:47,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649435430] [2025-01-10 07:35:47,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:47,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:47,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:35:47,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:35:47,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:47,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:47,071 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:47,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:35:47,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:35:47,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:47,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:47,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:47,097 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:35:47,098 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:35:47,098 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:35:47,098 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:35:47,098 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:35:47,098 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:47,098 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:35:47,098 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:35:47,098 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration5_Loop [2025-01-10 07:35:47,098 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:35:47,098 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:35:47,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:47,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:47,120 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:35:47,120 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:35:47,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:47,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:47,122 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:47,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 07:35:47,125 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:35:47,125 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:35:47,139 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:35:47,139 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:35:47,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-01-10 07:35:47,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:47,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:47,150 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:47,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 07:35:47,154 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:35:47,154 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:35:47,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-01-10 07:35:47,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:47,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:47,179 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:47,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 07:35:47,182 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:35:47,182 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:35:47,208 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:35:47,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-01-10 07:35:47,212 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:35:47,212 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:35:47,213 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:35:47,213 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:35:47,213 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:35:47,213 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:47,213 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:35:47,213 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:35:47,213 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration5_Loop [2025-01-10 07:35:47,213 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:35:47,213 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:35:47,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:47,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:47,242 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:35:47,243 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:35:47,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:47,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:47,245 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:47,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-01-10 07:35:47,247 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-01-10 07:35:47,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:35:47,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:35:47,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:35:47,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:35:47,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:35:47,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:35:47,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:35:47,259 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:35:47,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-01-10 07:35:47,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:47,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:47,268 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:47,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-01-10 07:35:47,270 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-01-10 07:35:47,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:35:47,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:35:47,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:35:47,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:35:47,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:35:47,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:35:47,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:35:47,284 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:35:47,287 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:35:47,287 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:35:47,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:47,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:47,290 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:47,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-01-10 07:35:47,292 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:35:47,293 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:35:47,293 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:35:47,293 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11 Supporting invariants [] [2025-01-10 07:35:47,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-01-10 07:35:47,300 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:35:47,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:47,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:35:47,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:35:47,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:47,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:47,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:35:47,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:47,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:47,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:47,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:47,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:47,336 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:35:47,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:47,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:47,337 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:35:47,337 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:47,345 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 28 transitions. Complement of second has 5 states. [2025-01-10 07:35:47,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:35:47,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-01-10 07:35:47,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2025-01-10 07:35:47,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:47,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 1 letters. [2025-01-10 07:35:47,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:47,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 2 letters. [2025-01-10 07:35:47,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:47,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2025-01-10 07:35:47,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-01-10 07:35:47,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 24 transitions. [2025-01-10 07:35:47,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-01-10 07:35:47,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-01-10 07:35:47,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2025-01-10 07:35:47,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:35:47,348 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-01-10 07:35:47,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2025-01-10 07:35:47,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2025-01-10 07:35:47,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-01-10 07:35:47,349 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-01-10 07:35:47,349 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-01-10 07:35:47,349 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:35:47,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2025-01-10 07:35:47,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-01-10 07:35:47,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:35:47,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:35:47,350 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 2, 1, 1, 1] [2025-01-10 07:35:47,350 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:35:47,350 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(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0;" "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" "assume !(main_~b~0#1 < 6);main_#t~pre5#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre5#1;" "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" [2025-01-10 07:35:47,350 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~b~0#1 < 6;main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1;" [2025-01-10 07:35:47,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:47,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1689565475, now seen corresponding path program 2 times [2025-01-10 07:35:47,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:47,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472607530] [2025-01-10 07:35:47,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:35:47,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:47,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 07:35:47,360 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:35:47,360 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:35:47,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:47,360 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:47,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:35:47,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:35:47,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:47,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:47,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:47,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:47,372 INFO L85 PathProgramCache]: Analyzing trace with hash 41, now seen corresponding path program 2 times [2025-01-10 07:35:47,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:47,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550990665] [2025-01-10 07:35:47,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:35:47,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:47,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:47,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:47,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:35:47,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:47,376 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:47,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:47,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:47,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:47,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:47,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:47,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:47,378 INFO L85 PathProgramCache]: Analyzing trace with hash -836922163, now seen corresponding path program 3 times [2025-01-10 07:35:47,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:47,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642725851] [2025-01-10 07:35:47,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:35:47,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:47,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 5 equivalence classes. [2025-01-10 07:35:47,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:35:47,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-10 07:35:47,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:47,387 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:47,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 07:35:47,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:35:47,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:47,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:47,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:47,412 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:35:47,412 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:35:47,412 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:35:47,412 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:35:47,412 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:35:47,412 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:47,412 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:35:47,412 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:35:47,412 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration6_Loop [2025-01-10 07:35:47,412 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:35:47,412 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:35:47,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:47,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:47,437 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:35:47,438 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:35:47,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:47,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:47,440 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:47,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-01-10 07:35:47,443 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:35:47,443 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:35:47,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-01-10 07:35:47,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:47,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:47,465 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:47,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-01-10 07:35:47,467 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:35:47,467 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:35:47,489 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:35:47,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-01-10 07:35:47,493 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:35:47,493 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:35:47,493 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:35:47,493 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:35:47,493 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:35:47,493 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:47,493 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:35:47,493 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:35:47,493 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration6_Loop [2025-01-10 07:35:47,493 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:35:47,493 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:35:47,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:47,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:47,520 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:35:47,520 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:35:47,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:47,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:47,523 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:47,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-01-10 07:35:47,526 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-01-10 07:35:47,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:35:47,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:35:47,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:35:47,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:35:47,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:35:47,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:35:47,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:35:47,543 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:35:47,546 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:35:47,546 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:35:47,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:47,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:47,551 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:47,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-01-10 07:35:47,554 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:35:47,554 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:35:47,554 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:35:47,555 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11 Supporting invariants [] [2025-01-10 07:35:47,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-01-10 07:35:47,563 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:35:47,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:47,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:35:47,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:35:47,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:47,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:47,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:35:47,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:47,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:47,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:47,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:47,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:47,621 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:35:47,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:47,624 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:35:47,624 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:47,635 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 25 transitions. Complement of second has 5 states. [2025-01-10 07:35:47,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:35:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-01-10 07:35:47,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 11 letters. Loop has 1 letters. [2025-01-10 07:35:47,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:47,636 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:35:47,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:47,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:35:47,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:35:47,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:47,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:47,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:35:47,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:47,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:47,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:47,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:47,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:47,693 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:35:47,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:47,694 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:35:47,694 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:47,703 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 25 transitions. Complement of second has 5 states. [2025-01-10 07:35:47,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:35:47,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:47,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-01-10 07:35:47,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 11 letters. Loop has 1 letters. [2025-01-10 07:35:47,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:47,706 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:35:47,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:47,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:35:47,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:35:47,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:47,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:47,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:35:47,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:47,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:47,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:47,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:47,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:47,758 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:35:47,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:47,759 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:35:47,759 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:47,771 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 16 transitions. Complement of second has 4 states. [2025-01-10 07:35:47,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:35:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-01-10 07:35:47,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 11 letters. Loop has 1 letters. [2025-01-10 07:35:47,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:47,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 1 letters. [2025-01-10 07:35:47,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:47,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 11 letters. Loop has 2 letters. [2025-01-10 07:35:47,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:47,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2025-01-10 07:35:47,777 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:35:47,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2025-01-10 07:35:47,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 07:35:47,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 07:35:47,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 07:35:47,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:35:47,777 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:35:47,777 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:35:47,777 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:35:47,777 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:35:47,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-01-10 07:35:47,777 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:35:47,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-01-10 07:35:47,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:35:47 BoogieIcfgContainer [2025-01-10 07:35:47,788 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:35:47,789 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:35:47,789 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:35:47,789 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:35:47,790 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:35:45" (3/4) ... [2025-01-10 07:35:47,791 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 07:35:47,792 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:35:47,793 INFO L158 Benchmark]: Toolchain (without parser) took 2675.00ms. Allocated memory is still 167.8MB. Free memory was 133.8MB in the beginning and 87.0MB in the end (delta: 46.8MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2025-01-10 07:35:47,793 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:35:47,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.41ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 123.2MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:35:47,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.95ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 122.2MB in the end (delta: 932.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:35:47,795 INFO L158 Benchmark]: Boogie Preprocessor took 31.89ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 121.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:35:47,795 INFO L158 Benchmark]: RCFGBuilder took 205.13ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 111.6MB in the end (delta: 9.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:35:47,796 INFO L158 Benchmark]: BuchiAutomizer took 2236.38ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 87.0MB in the end (delta: 24.6MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2025-01-10 07:35:47,796 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 167.8MB. Free memory was 87.0MB in the beginning and 87.0MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:35:47,799 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.26ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 165.41ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 123.2MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.95ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 122.2MB in the end (delta: 932.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.89ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 121.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 205.13ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 111.6MB in the end (delta: 9.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 2236.38ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 87.0MB in the end (delta: 24.6MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 167.8MB. Free memory was 87.0MB in the beginning and 87.0MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * a) + 11) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 3 locations. One nondeterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 7 iterations. TraceHistogramMax:6. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 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, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 21/21 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 38 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp92 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-01-10 07:35:47,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-01-10 07:35:48,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-01-10 07:35:48,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 07:35:48,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 07:35:48,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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