./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-recursive-malloc/rec_malloc_ex2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash b91dcc12f43fdd03af0529f07bf7885945925554291ddde3b9ca40d8f32b93c1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:10:09,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:10:09,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 07:10:09,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:10:09,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:10:09,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:10:09,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:10:09,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:10:09,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:10:09,233 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:10:09,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:10:09,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:10:09,234 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:10:09,234 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:10:09,234 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:10:09,234 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:10:09,234 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:10:09,234 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:10:09,234 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:10:09,234 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:10:09,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:10:09,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:10:09,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:10:09,234 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:10:09,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:10:09,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:10:09,235 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:10:09,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:10:09,235 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:10:09,235 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:10:09,235 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:10:09,235 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:10:09,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:10:09,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:10:09,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:10:09,235 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:10:09,235 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b91dcc12f43fdd03af0529f07bf7885945925554291ddde3b9ca40d8f32b93c1 [2025-01-10 07:10:09,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:10:09,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:10:09,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:10:09,471 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:10:09,471 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:10:09,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i [2025-01-10 07:10:10,626 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6dec8b4ea/d4b193be069548d8be8c8c3bf0d3940b/FLAGa07d46960 [2025-01-10 07:10:10,838 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:10:10,838 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i [2025-01-10 07:10:10,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6dec8b4ea/d4b193be069548d8be8c8c3bf0d3940b/FLAGa07d46960 [2025-01-10 07:10:11,207 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6dec8b4ea/d4b193be069548d8be8c8c3bf0d3940b [2025-01-10 07:10:11,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:10:11,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:10:11,214 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:10:11,214 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:10:11,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:10:11,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:10:11" (1/1) ... [2025-01-10 07:10:11,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38d58c46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:11, skipping insertion in model container [2025-01-10 07:10:11,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:10:11" (1/1) ... [2025-01-10 07:10:11,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:10:11,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:10:11,358 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:10:11,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:10:11,379 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:10:11,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:11 WrapperNode [2025-01-10 07:10:11,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:10:11,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:10:11,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:10:11,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:10:11,386 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:10:11" (1/1) ... [2025-01-10 07:10:11,392 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:10:11" (1/1) ... [2025-01-10 07:10:11,401 INFO L138 Inliner]: procedures = 11, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28 [2025-01-10 07:10:11,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:10:11,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:10:11,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:10:11,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:10:11,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:11" (1/1) ... [2025-01-10 07:10:11,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:11" (1/1) ... [2025-01-10 07:10:11,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:11" (1/1) ... [2025-01-10 07:10:11,421 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [5, 5]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-01-10 07:10:11,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:11" (1/1) ... [2025-01-10 07:10:11,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:11" (1/1) ... [2025-01-10 07:10:11,426 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:11" (1/1) ... [2025-01-10 07:10:11,428 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:11" (1/1) ... [2025-01-10 07:10:11,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:11" (1/1) ... [2025-01-10 07:10:11,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:11" (1/1) ... [2025-01-10 07:10:11,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:11" (1/1) ... [2025-01-10 07:10:11,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:10:11,436 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:10:11,436 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:10:11,436 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:10:11,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:11" (1/1) ... [2025-01-10 07:10:11,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:11,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:11,472 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:10:11,481 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:10:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:10:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 07:10:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2025-01-10 07:10:11,498 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2025-01-10 07:10:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 07:10:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:10:11,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:10:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 07:10:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 07:10:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 07:10:11,551 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:10:11,553 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:10:11,662 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-01-10 07:10:11,664 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:10:11,669 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:10:11,670 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 07:10:11,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:10:11 BoogieIcfgContainer [2025-01-10 07:10:11,670 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:10:11,671 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:10:11,671 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:10:11,675 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:10:11,675 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:10:11,675 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:10:11" (1/3) ... [2025-01-10 07:10:11,676 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f36fdd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:10:11, skipping insertion in model container [2025-01-10 07:10:11,677 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:10:11,677 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:11" (2/3) ... [2025-01-10 07:10:11,677 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f36fdd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:10:11, skipping insertion in model container [2025-01-10 07:10:11,677 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:10:11,677 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:10:11" (3/3) ... [2025-01-10 07:10:11,678 INFO L363 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex2.i [2025-01-10 07:10:11,717 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:10:11,718 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:10:11,718 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:10:11,718 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:10:11,719 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:10:11,719 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:10:11,719 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:10:11,719 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:10:11,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 07:10:11,737 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-01-10 07:10:11,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:11,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:11,742 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:10:11,742 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:10:11,742 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:10:11,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 07:10:11,744 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-01-10 07:10:11,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:11,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:11,744 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:10:11,745 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:10:11,749 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~mem9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1;" [2025-01-10 07:10:11,751 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem9#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "assume main_#t~mem9#1 > 1;havoc main_#t~mem9#1;" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#1(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#1(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0;" "assume true;" >"#32#return;" "call write~int#0(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~mem13#1;havoc main_#t~ret12#1;" [2025-01-10 07:10:11,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:11,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2025-01-10 07:10:11,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:11,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788018035] [2025-01-10 07:10:11,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:11,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:11,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:11,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:11,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:11,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:11,829 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:11,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:11,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:11,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:11,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:11,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:11,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:11,852 INFO L85 PathProgramCache]: Analyzing trace with hash -2117725971, now seen corresponding path program 1 times [2025-01-10 07:10:11,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:11,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343959143] [2025-01-10 07:10:11,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:11,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:11,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:10:11,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:10:11,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:11,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:12,236 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:10:12,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:12,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343959143] [2025-01-10 07:10:12,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343959143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:10:12,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:10:12,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 07:10:12,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017917334] [2025-01-10 07:10:12,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:10:12,244 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:10:12,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:12,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 07:10:12,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 07:10:12,265 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 07:10:12,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:12,367 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-01-10 07:10:12,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2025-01-10 07:10:12,371 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-01-10 07:10:12,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 15 states and 17 transitions. [2025-01-10 07:10:12,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-01-10 07:10:12,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-01-10 07:10:12,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2025-01-10 07:10:12,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:10:12,379 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-01-10 07:10:12,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2025-01-10 07:10:12,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-01-10 07:10:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:10:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2025-01-10 07:10:12,397 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-01-10 07:10:12,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 07:10:12,401 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-01-10 07:10:12,401 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:10:12,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2025-01-10 07:10:12,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-01-10 07:10:12,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:12,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:12,402 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:10:12,403 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:10:12,403 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~mem9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1;" [2025-01-10 07:10:12,403 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem9#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "assume main_#t~mem9#1 > 1;havoc main_#t~mem9#1;" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#1(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#1(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0;" "assume true;" >"#30#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#32#return;" "call write~int#0(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~mem13#1;havoc main_#t~ret12#1;" [2025-01-10 07:10:12,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:12,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2025-01-10 07:10:12,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:12,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275855673] [2025-01-10 07:10:12,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:10:12,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:12,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:12,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:12,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:10:12,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:12,432 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:12,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:12,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:12,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:12,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:12,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:12,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:12,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1815924899, now seen corresponding path program 1 times [2025-01-10 07:10:12,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:12,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371332270] [2025-01-10 07:10:12,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:12,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:12,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 07:10:12,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 07:10:12,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:12,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 07:10:12,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:12,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371332270] [2025-01-10 07:10:12,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371332270] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:12,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099582235] [2025-01-10 07:10:12,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:12,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:12,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:12,979 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:10:12,985 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:10:13,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 07:10:13,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 07:10:13,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:13,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:13,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-10 07:10:13,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:13,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 07:10:13,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-10 07:10:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:10:13,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:13,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:13,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099582235] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:13,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:13,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 25 [2025-01-10 07:10:13,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617347340] [2025-01-10 07:10:13,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:13,665 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:10:13,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:13,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 07:10:13,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2025-01-10 07:10:13,666 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand has 26 states, 20 states have (on average 1.45) internal successors, (29), 22 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 07:10:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:13,823 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-01-10 07:10:13,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2025-01-10 07:10:13,824 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-01-10 07:10:13,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 20 transitions. [2025-01-10 07:10:13,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-01-10 07:10:13,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-01-10 07:10:13,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2025-01-10 07:10:13,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:10:13,826 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-01-10 07:10:13,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2025-01-10 07:10:13,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-01-10 07:10:13,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 07:10:13,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-01-10 07:10:13,828 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-01-10 07:10:13,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 07:10:13,829 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-01-10 07:10:13,829 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:10:13,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2025-01-10 07:10:13,831 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-01-10 07:10:13,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:13,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:13,831 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:10:13,832 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:10:13,832 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~mem9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1;" [2025-01-10 07:10:13,832 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem9#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "assume main_#t~mem9#1 > 1;havoc main_#t~mem9#1;" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#1(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#1(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0;" "assume true;" >"#30#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#30#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#32#return;" "call write~int#0(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~mem13#1;havoc main_#t~ret12#1;" [2025-01-10 07:10:13,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:13,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2025-01-10 07:10:13,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:13,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383117559] [2025-01-10 07:10:13,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:10:13,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:13,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:13,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:13,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:10:13,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:13,852 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:13,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:13,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:13,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:13,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:13,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:13,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:13,856 INFO L85 PathProgramCache]: Analyzing trace with hash -189486803, now seen corresponding path program 2 times [2025-01-10 07:10:13,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:13,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338422084] [2025-01-10 07:10:13,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:10:13,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:13,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-10 07:10:13,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 07:10:13,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:10:13,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 07:10:14,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:14,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338422084] [2025-01-10 07:10:14,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338422084] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:14,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137080648] [2025-01-10 07:10:14,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:10:14,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:14,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:14,404 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:10:14,408 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:10:14,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-10 07:10:14,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 07:10:14,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:10:14,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:14,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-10 07:10:14,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:14,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 07:10:14,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-10 07:10:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 07:10:14,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:15,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137080648] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:15,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 07:10:15,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2025-01-10 07:10:15,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733539164] [2025-01-10 07:10:15,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:15,044 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:10:15,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:15,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 07:10:15,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2025-01-10 07:10:15,044 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 20 states have internal predecessors, (27), 5 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 07:10:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:15,328 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-01-10 07:10:15,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2025-01-10 07:10:15,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-01-10 07:10:15,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 23 transitions. [2025-01-10 07:10:15,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-01-10 07:10:15,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-01-10 07:10:15,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2025-01-10 07:10:15,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:10:15,330 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 23 transitions. [2025-01-10 07:10:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2025-01-10 07:10:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-01-10 07:10:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 07:10:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2025-01-10 07:10:15,331 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 23 transitions. [2025-01-10 07:10:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 07:10:15,334 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2025-01-10 07:10:15,334 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:10:15,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2025-01-10 07:10:15,335 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-01-10 07:10:15,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:15,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:15,336 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:10:15,336 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:10:15,336 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~mem9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1;" [2025-01-10 07:10:15,336 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem9#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "assume main_#t~mem9#1 > 1;havoc main_#t~mem9#1;" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#1(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#1(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0;" "assume true;" >"#30#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#30#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#30#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#32#return;" "call write~int#0(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~mem13#1;havoc main_#t~ret12#1;" [2025-01-10 07:10:15,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:15,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 4 times [2025-01-10 07:10:15,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:15,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429469897] [2025-01-10 07:10:15,336 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:10:15,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:15,341 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-01-10 07:10:15,345 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:10:15,345 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:10:15,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:15,346 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:15,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:15,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:15,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:15,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:15,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:15,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:15,353 INFO L85 PathProgramCache]: Analyzing trace with hash -121644131, now seen corresponding path program 3 times [2025-01-10 07:10:15,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:15,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191132654] [2025-01-10 07:10:15,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:10:15,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:15,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-01-10 07:10:15,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:10:15,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 07:10:15,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:15,390 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:15,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 07:10:15,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:10:15,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:15,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:15,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:15,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:15,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1153110629, now seen corresponding path program 1 times [2025-01-10 07:10:15,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:15,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533717091] [2025-01-10 07:10:15,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:15,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:15,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 07:10:15,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 07:10:15,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:15,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:15,431 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:15,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 07:10:15,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 07:10:15,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:15,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:15,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:17,633 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:10:17,634 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:10:17,634 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:10:17,634 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:10:17,634 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:10:17,634 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:17,634 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:10:17,634 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:10:17,634 INFO L132 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2.i_Iteration4_Lasso [2025-01-10 07:10:17,634 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:10:17,634 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:10:17,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:17,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:17,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:17,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:17,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:17,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:17,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:17,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:17,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:17,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:17,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:17,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:17,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:18,313 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:10:18,316 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:10:18,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:18,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:18,320 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:10:18,322 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:10:18,323 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:10:18,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:18,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:18,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:18,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:18,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:18,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:18,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:18,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:18,349 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:10:18,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:18,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:18,352 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:10:18,353 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:10:18,353 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:10:18,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:18,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:18,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:18,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:18,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:18,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:18,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:18,365 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:18,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-01-10 07:10:18,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:18,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:18,372 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:10:18,374 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:10:18,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:18,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:18,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:18,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:18,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:18,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:18,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:18,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:18,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:18,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:18,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:18,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:18,400 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:10:18,401 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:10:18,402 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:10:18,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:18,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:18,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:18,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:18,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:18,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:18,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:18,418 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:18,423 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:10:18,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:18,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:18,426 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:10:18,427 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:10:18,427 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:10:18,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:18,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:18,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:18,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:18,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:18,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:18,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:18,440 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:18,445 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:10:18,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:18,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:18,447 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:10:18,449 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:10:18,450 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:10:18,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:18,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:18,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:18,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:18,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:18,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:18,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:18,473 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:10:18,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:18,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:18,475 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:10:18,476 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:10:18,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:18,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:18,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:18,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:18,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:18,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:18,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:18,492 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:18,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:18,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:18,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:18,501 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:10:18,504 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:10:18,504 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:10:18,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:18,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:18,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:18,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:18,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:18,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:18,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:18,525 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:10:18,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:18,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:18,527 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:10:18,528 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:10:18,529 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:10:18,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:18,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:18,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:18,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:18,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:18,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:18,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:18,548 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:10:18,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:18,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:18,550 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:10:18,552 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:10:18,552 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:10:18,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:18,562 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-01-10 07:10:18,562 INFO L204 nArgumentSynthesizer]: 16 loop disjuncts [2025-01-10 07:10:18,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:18,778 INFO L401 nArgumentSynthesizer]: We have 608 Motzkin's Theorem applications. [2025-01-10 07:10:18,778 INFO L402 nArgumentSynthesizer]: A total of 32 supporting invariants were added. [2025-01-10 07:10:19,301 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:19,317 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:10:19,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:19,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:19,319 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:10:19,320 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:10:19,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:19,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:19,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:19,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:19,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:19,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:19,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:19,338 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:10:19,350 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-01-10 07:10:19,352 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-01-10 07:10:19,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:19,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:19,355 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:10:19,356 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:10:19,361 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:10:19,381 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:10:19,381 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:10:19,382 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~ip~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~ip~0#1.base) 0)_1 Supporting invariants [] [2025-01-10 07:10:19,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-01-10 07:10:19,397 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2025-01-10 07:10:19,400 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-01-10 07:10:19,401 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-01-10 07:10:19,401 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~ip~0!base,]]] [2025-01-10 07:10:19,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:19,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:19,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:19,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:19,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:19,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:10:19,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:19,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 07:10:19,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:10:19,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:19,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:19,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 07:10:19,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:19,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 07:10:19,718 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:10:19,735 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 07:10:19,737 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2025-01-10 07:10:19,738 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 07:10:19,852 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 68 states and 75 transitions. Complement of second has 26 states. [2025-01-10 07:10:19,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2025-01-10 07:10:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 07:10:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2025-01-10 07:10:19,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. Stem has 2 letters. Loop has 27 letters. [2025-01-10 07:10:19,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:19,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. Stem has 29 letters. Loop has 27 letters. [2025-01-10 07:10:19,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:19,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. Stem has 2 letters. Loop has 54 letters. [2025-01-10 07:10:19,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:19,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 75 transitions. [2025-01-10 07:10:19,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:10:19,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 37 states and 42 transitions. [2025-01-10 07:10:19,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-01-10 07:10:19,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-01-10 07:10:19,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 42 transitions. [2025-01-10 07:10:19,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:10:19,860 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-01-10 07:10:19,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 42 transitions. [2025-01-10 07:10:19,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2025-01-10 07:10:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 07:10:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-01-10 07:10:19,862 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-01-10 07:10:19,862 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-01-10 07:10:19,862 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:10:19,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2025-01-10 07:10:19,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:10:19,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:19,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:19,863 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-01-10 07:10:19,863 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:19,863 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~mem9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1;" "call main_#t~mem9#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "assume main_#t~mem9#1 > 1;havoc main_#t~mem9#1;" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#1(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);"< [2025-01-10 07:10:19,864 INFO L754 eck$LassoCheckResult]: Loop: "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< [2025-01-10 07:10:19,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:19,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1126206192, now seen corresponding path program 1 times [2025-01-10 07:10:19,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:19,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014830169] [2025-01-10 07:10:19,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:19,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:19,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:10:19,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:10:19,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:19,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:19,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:19,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:10:19,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:10:19,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:19,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:19,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:19,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:19,883 INFO L85 PathProgramCache]: Analyzing trace with hash 29944, now seen corresponding path program 1 times [2025-01-10 07:10:19,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:19,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775561220] [2025-01-10 07:10:19,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:19,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:19,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:19,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:19,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:19,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:19,895 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:19,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:19,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:19,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:19,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:19,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:19,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:19,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1475850327, now seen corresponding path program 1 times [2025-01-10 07:10:19,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:19,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079295259] [2025-01-10 07:10:19,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:19,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:19,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:10:19,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:10:19,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:19,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:19,915 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:19,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:10:19,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:10:19,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:19,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:19,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:20,747 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:10:20,747 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:10:20,748 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:10:20,748 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:10:20,748 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:10:20,748 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:20,748 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:10:20,748 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:10:20,748 INFO L132 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2.i_Iteration5_Lasso [2025-01-10 07:10:20,748 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:10:20,748 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:10:20,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:20,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:20,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:20,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:20,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:20,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:20,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:20,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:20,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:20,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:20,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:20,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:21,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:21,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:21,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:21,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:21,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:21,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:21,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:21,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:21,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:21,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:21,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:21,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:21,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:21,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:21,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:21,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:21,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:21,531 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:10:21,531 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:10:21,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:21,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:21,535 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:10:21,536 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:10:21,537 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:10:21,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:21,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:21,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:21,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:21,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:21,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:21,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:21,548 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:21,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:21,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:21,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:21,556 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:10:21,557 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:10:21,558 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:10:21,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:21,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:21,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:21,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:21,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:21,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:21,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:21,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:21,577 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:10:21,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:21,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:21,578 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:10:21,580 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:10:21,581 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:10:21,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:21,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:21,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:21,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:21,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:21,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:21,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:21,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:21,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:21,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:21,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:21,599 INFO L229 MonitoredProcess]: Starting monitored process 19 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:10:21,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-01-10 07:10:21,601 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:10:21,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:21,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:21,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:21,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:21,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:21,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:21,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:21,612 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:21,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:21,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:21,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:21,619 INFO L229 MonitoredProcess]: Starting monitored process 20 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:10:21,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-01-10 07:10:21,622 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:10:21,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:21,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:21,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:21,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:21,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:21,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:21,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:21,634 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:21,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:21,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:21,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:21,642 INFO L229 MonitoredProcess]: Starting monitored process 21 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:10:21,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-01-10 07:10:21,644 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:10:21,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:21,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:21,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:21,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:21,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:21,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:21,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:21,655 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:21,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:21,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:21,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:21,663 INFO L229 MonitoredProcess]: Starting monitored process 22 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:10:21,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-01-10 07:10:21,667 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:10:21,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:21,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:21,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:21,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:21,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:21,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:21,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:21,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:21,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:21,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:21,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:21,691 INFO L229 MonitoredProcess]: Starting monitored process 23 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:10:21,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-01-10 07:10:21,693 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:10:21,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:21,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:21,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:21,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:21,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:21,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:21,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:21,708 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:21,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-01-10 07:10:21,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:21,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:21,722 INFO L229 MonitoredProcess]: Starting monitored process 24 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:10:21,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-01-10 07:10:21,733 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:10:21,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:21,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:21,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:21,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:21,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:21,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:21,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:21,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:21,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-01-10 07:10:21,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:21,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:21,753 INFO L229 MonitoredProcess]: Starting monitored process 25 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:10:21,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-01-10 07:10:21,755 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:10:21,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:21,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:21,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:21,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:21,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:21,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:21,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:21,766 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:21,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-01-10 07:10:21,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:21,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:21,773 INFO L229 MonitoredProcess]: Starting monitored process 26 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:10:21,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-01-10 07:10:21,778 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:10:21,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:21,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:21,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:21,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:21,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:21,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:21,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:21,792 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:21,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-01-10 07:10:21,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:21,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:21,799 INFO L229 MonitoredProcess]: Starting monitored process 27 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:10:21,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-01-10 07:10:21,801 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:10:21,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:21,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:21,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:21,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:21,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:21,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:21,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:21,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:21,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:21,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:21,823 INFO L229 MonitoredProcess]: Starting monitored process 28 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:10:21,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-01-10 07:10:21,825 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:10:21,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:21,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:21,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:21,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:21,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:21,837 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:21,840 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:21,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-01-10 07:10:21,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:21,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:21,847 INFO L229 MonitoredProcess]: Starting monitored process 29 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:10:21,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-01-10 07:10:21,849 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:10:21,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:21,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:21,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:21,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:21,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:21,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:21,864 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:21,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-01-10 07:10:21,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:21,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:21,872 INFO L229 MonitoredProcess]: Starting monitored process 30 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:10:21,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-01-10 07:10:21,876 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:10:21,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:21,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:21,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:21,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:21,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:21,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:21,899 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:10:21,917 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-01-10 07:10:21,917 INFO L444 ModelExtractionUtils]: 10 out of 19 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-01-10 07:10:21,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:21,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:21,919 INFO L229 MonitoredProcess]: Starting monitored process 31 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:10:21,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-01-10 07:10:21,921 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:10:21,931 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:10:21,931 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:10:21,932 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 rec_#in~p.base) rec_#in~p.offset)_1) = 2*v_rep(select (select #memory_int#1 rec_#in~p.base) rec_#in~p.offset)_1 + 1 Supporting invariants [] [2025-01-10 07:10:21,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-01-10 07:10:21,944 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-01-10 07:10:21,947 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-10 07:10:21,947 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-10 07:10:21,948 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] [2025-01-10 07:10:21,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:21,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:10:21,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:10:21,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:21,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:21,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:10:21,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:21,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:21,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:21,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:21,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:21,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 07:10:21,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:22,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2025-01-10 07:10:22,027 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:10:22,031 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-01-10 07:10:22,031 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 7 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:22,125 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 7. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 61 states and 70 transitions. Complement of second has 14 states. [2025-01-10 07:10:22,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-01-10 07:10:22,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2025-01-10 07:10:22,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2025-01-10 07:10:22,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:22,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 9 letters. Loop has 3 letters. [2025-01-10 07:10:22,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:22,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 6 letters. Loop has 6 letters. [2025-01-10 07:10:22,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:22,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 70 transitions. [2025-01-10 07:10:22,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:10:22,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 43 states and 51 transitions. [2025-01-10 07:10:22,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-01-10 07:10:22,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-01-10 07:10:22,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 51 transitions. [2025-01-10 07:10:22,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:10:22,138 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-01-10 07:10:22,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 51 transitions. [2025-01-10 07:10:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-01-10 07:10:22,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.1) internal successors, (33), 33 states have internal predecessors, (33), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) [2025-01-10 07:10:22,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-01-10 07:10:22,145 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-01-10 07:10:22,145 INFO L432 stractBuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-01-10 07:10:22,145 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:10:22,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 51 transitions. [2025-01-10 07:10:22,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:10:22,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:22,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:22,147 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 07:10:22,147 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:22,147 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~mem9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1;" "call main_#t~mem9#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "assume main_#t~mem9#1 > 1;havoc main_#t~mem9#1;" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#1(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#1(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0;" "assume true;" >"#30#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#30#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#30#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#32#return;" "call write~int#0(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~mem13#1;havoc main_#t~ret12#1;" "call main_#t~mem9#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "assume main_#t~mem9#1 > 1;havoc main_#t~mem9#1;" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#1(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);"< [2025-01-10 07:10:22,147 INFO L754 eck$LassoCheckResult]: Loop: "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< [2025-01-10 07:10:22,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:22,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1919596600, now seen corresponding path program 2 times [2025-01-10 07:10:22,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:22,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384685303] [2025-01-10 07:10:22,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:10:22,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:22,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-10 07:10:22,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 07:10:22,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:10:22,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:22,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-01-10 07:10:23,045 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 07:10:23,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:23,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384685303] [2025-01-10 07:10:23,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384685303] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:23,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106389656] [2025-01-10 07:10:23,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:10:23,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:23,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:23,048 INFO L229 MonitoredProcess]: Starting monitored process 32 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:10:23,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-01-10 07:10:23,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-10 07:10:23,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 07:10:23,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:10:23,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:23,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-01-10 07:10:23,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:23,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 07:10:23,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 07:10:23,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-01-10 07:10:23,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:10:23,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 07:10:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 07:10:23,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:24,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2025-01-10 07:10:24,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2025-01-10 07:10:24,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2025-01-10 07:10:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:24,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106389656] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:24,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:24,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 24] total 48 [2025-01-10 07:10:24,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939580367] [2025-01-10 07:10:24,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:24,961 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:24,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:24,961 INFO L85 PathProgramCache]: Analyzing trace with hash 29944, now seen corresponding path program 2 times [2025-01-10 07:10:24,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:24,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879498541] [2025-01-10 07:10:24,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:10:24,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:24,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:24,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:24,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:10:24,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:24,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:24,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:24,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:24,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:24,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:24,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:25,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:25,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-10 07:10:25,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2049, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 07:10:25,226 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. cyclomatic complexity: 12 Second operand has 48 states, 40 states have (on average 1.275) internal successors, (51), 32 states have internal predecessors, (51), 9 states have call successors, (9), 6 states have call predecessors, (9), 12 states have return successors, (12), 11 states have call predecessors, (12), 8 states have call successors, (12) [2025-01-10 07:10:25,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:25,643 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2025-01-10 07:10:25,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 70 transitions. [2025-01-10 07:10:25,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:10:25,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 49 states and 61 transitions. [2025-01-10 07:10:25,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-01-10 07:10:25,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-01-10 07:10:25,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 61 transitions. [2025-01-10 07:10:25,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:10:25,647 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 61 transitions. [2025-01-10 07:10:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 61 transitions. [2025-01-10 07:10:25,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2025-01-10 07:10:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.09375) internal successors, (35), 35 states have internal predecessors, (35), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-10 07:10:25,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2025-01-10 07:10:25,654 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 55 transitions. [2025-01-10 07:10:25,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 07:10:25,656 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2025-01-10 07:10:25,656 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:10:25,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 55 transitions. [2025-01-10 07:10:25,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:10:25,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:25,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:25,658 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 07:10:25,658 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:25,658 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~mem9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1;" "call main_#t~mem9#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "assume main_#t~mem9#1 > 1;havoc main_#t~mem9#1;" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#1(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#1(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0;" "assume true;" >"#30#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#30#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#30#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#30#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#32#return;" "call write~int#0(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~mem13#1;havoc main_#t~ret12#1;" "call main_#t~mem9#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "assume main_#t~mem9#1 > 1;havoc main_#t~mem9#1;" "call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int#1(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int#0(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);"< [2025-01-10 07:10:25,658 INFO L754 eck$LassoCheckResult]: Loop: "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int#1(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int#1(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int#1(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< [2025-01-10 07:10:25,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:25,658 INFO L85 PathProgramCache]: Analyzing trace with hash 872591128, now seen corresponding path program 3 times [2025-01-10 07:10:25,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:25,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824729753] [2025-01-10 07:10:25,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:10:25,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:25,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 6 equivalence classes. [2025-01-10 07:10:25,692 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 07:10:25,692 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 07:10:25,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:25,692 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:25,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 07:10:25,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 07:10:25,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:25,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:25,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:25,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:25,710 INFO L85 PathProgramCache]: Analyzing trace with hash 29944, now seen corresponding path program 3 times [2025-01-10 07:10:25,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:25,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477955108] [2025-01-10 07:10:25,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:10:25,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:25,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:25,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:25,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:10:25,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:25,714 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:25,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:25,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:25,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:25,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:25,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:25,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:25,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2074748287, now seen corresponding path program 4 times [2025-01-10 07:10:25,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:25,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730251561] [2025-01-10 07:10:25,717 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:10:25,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:25,724 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-01-10 07:10:25,749 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 07:10:25,749 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:10:25,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:25,749 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:25,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 07:10:25,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 07:10:25,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:25,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:25,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:29,832 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:10:29,832 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:10:29,832 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:10:29,832 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:10:29,832 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:10:29,832 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:29,832 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:10:29,832 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:10:29,832 INFO L132 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2.i_Iteration7_Lasso [2025-01-10 07:10:29,832 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:10:29,832 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:10:29,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:29,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:29,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:29,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:29,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:29,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:29,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:29,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:29,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:29,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:29,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:29,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:29,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:29,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:29,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:29,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:29,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:29,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:29,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:29,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:29,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:30,344 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2025-01-10 07:10:35,043 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:10:35,043 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:10:35,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,045 INFO L229 MonitoredProcess]: Starting monitored process 33 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:10:35,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-01-10 07:10:35,047 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:10:35,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:35,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:35,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:35,059 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-01-10 07:10:35,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,067 INFO L229 MonitoredProcess]: Starting monitored process 34 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:10:35,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-01-10 07:10:35,069 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:10:35,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:35,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:35,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:35,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:35,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,088 INFO L229 MonitoredProcess]: Starting monitored process 35 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:10:35,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-01-10 07:10:35,090 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:10:35,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:35,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:35,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:35,101 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:35,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,108 INFO L229 MonitoredProcess]: Starting monitored process 36 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:10:35,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-01-10 07:10:35,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:35,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:35,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:35,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:35,121 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-01-10 07:10:35,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,128 INFO L229 MonitoredProcess]: Starting monitored process 37 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:10:35,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-01-10 07:10:35,131 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:10:35,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:35,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:35,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:35,146 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-01-10 07:10:35,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,161 INFO L229 MonitoredProcess]: Starting monitored process 38 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:10:35,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-01-10 07:10:35,163 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:10:35,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:35,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:35,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:35,181 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-01-10 07:10:35,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,195 INFO L229 MonitoredProcess]: Starting monitored process 39 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:10:35,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-01-10 07:10:35,198 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:10:35,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:35,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:35,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:35,210 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-01-10 07:10:35,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,221 INFO L229 MonitoredProcess]: Starting monitored process 40 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:10:35,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-01-10 07:10:35,225 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:10:35,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:35,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:35,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:35,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:35,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,244 INFO L229 MonitoredProcess]: Starting monitored process 41 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:10:35,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-01-10 07:10:35,246 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:10:35,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:35,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:35,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:35,257 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-01-10 07:10:35,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,265 INFO L229 MonitoredProcess]: Starting monitored process 42 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:10:35,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-01-10 07:10:35,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:35,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:35,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:35,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:35,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:35,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,285 INFO L229 MonitoredProcess]: Starting monitored process 43 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:10:35,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-01-10 07:10:35,286 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:10:35,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:35,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:35,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:35,298 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-01-10 07:10:35,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,305 INFO L229 MonitoredProcess]: Starting monitored process 44 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:10:35,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-01-10 07:10:35,309 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:10:35,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:35,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:35,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:35,321 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:35,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,328 INFO L229 MonitoredProcess]: Starting monitored process 45 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:10:35,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-01-10 07:10:35,330 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:10:35,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:35,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:35,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:35,341 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:35,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,349 INFO L229 MonitoredProcess]: Starting monitored process 46 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:10:35,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-01-10 07:10:35,351 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:10:35,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:35,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:35,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:35,362 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-01-10 07:10:35,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,372 INFO L229 MonitoredProcess]: Starting monitored process 47 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:10:35,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-01-10 07:10:35,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:35,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:35,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:35,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:35,386 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:35,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,394 INFO L229 MonitoredProcess]: Starting monitored process 48 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:10:35,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-01-10 07:10:35,395 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:10:35,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:35,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:35,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:35,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-01-10 07:10:35,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,414 INFO L229 MonitoredProcess]: Starting monitored process 49 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:10:35,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-01-10 07:10:35,417 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:10:35,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:35,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:35,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:35,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-01-10 07:10:35,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,436 INFO L229 MonitoredProcess]: Starting monitored process 50 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:10:35,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-01-10 07:10:35,439 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:10:35,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:35,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:35,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:35,451 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:35,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,458 INFO L229 MonitoredProcess]: Starting monitored process 51 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:10:35,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-01-10 07:10:35,460 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:10:35,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:35,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:35,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:35,471 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:35,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,478 INFO L229 MonitoredProcess]: Starting monitored process 52 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:10:35,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-01-10 07:10:35,479 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:10:35,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:35,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:35,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:35,491 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-01-10 07:10:35,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,498 INFO L229 MonitoredProcess]: Starting monitored process 53 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:10:35,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-01-10 07:10:35,499 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:10:35,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:35,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:35,516 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-01-10 07:10:35,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,524 INFO L229 MonitoredProcess]: Starting monitored process 54 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:10:35,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-01-10 07:10:35,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:10:35,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:35,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:35,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-01-10 07:10:35,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,548 INFO L229 MonitoredProcess]: Starting monitored process 55 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:10:35,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-01-10 07:10:35,549 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:10:35,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:35,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:35,563 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:35,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-01-10 07:10:35,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,571 INFO L229 MonitoredProcess]: Starting monitored process 56 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:10:35,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-01-10 07:10:35,572 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:10:35,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:35,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:35,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:35,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:35,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:35,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:35,592 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:10:35,616 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-01-10 07:10:35,616 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-01-10 07:10:35,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:35,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,623 INFO L229 MonitoredProcess]: Starting monitored process 57 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:10:35,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-01-10 07:10:35,624 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:10:35,635 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:10:35,636 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:10:35,636 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 rec_#in~p.base) rec_#in~p.offset)_2) = 2*v_rep(select (select #memory_int#1 rec_#in~p.base) rec_#in~p.offset)_2 + 1 Supporting invariants [] [2025-01-10 07:10:35,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-01-10 07:10:35,650 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-01-10 07:10:35,651 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-10 07:10:35,651 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-10 07:10:35,651 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] [2025-01-10 07:10:35,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:35,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 07:10:35,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 07:10:35,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:35,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:35,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 07:10:35,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:36,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-01-10 07:10:36,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:36,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:36,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:36,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:36,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 07:10:36,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:36,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2025-01-10 07:10:36,058 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:10:36,059 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-01-10 07:10:36,059 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 55 transitions. cyclomatic complexity: 13 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 07:10:36,105 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 55 transitions. cyclomatic complexity: 13. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 53 states and 62 transitions. Complement of second has 14 states. [2025-01-10 07:10:36,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-01-10 07:10:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 07:10:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2025-01-10 07:10:36,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 39 letters. Loop has 3 letters. [2025-01-10 07:10:36,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:36,108 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:10:36,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:36,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 07:10:36,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 07:10:36,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:36,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:36,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 07:10:36,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:36,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:36,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:36,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:36,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:36,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 07:10:36,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:36,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2025-01-10 07:10:36,389 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:10:36,389 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2025-01-10 07:10:36,389 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 55 transitions. cyclomatic complexity: 13 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 07:10:36,432 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 55 transitions. cyclomatic complexity: 13. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 53 states and 62 transitions. Complement of second has 14 states. [2025-01-10 07:10:36,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-01-10 07:10:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 07:10:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2025-01-10 07:10:36,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 39 letters. Loop has 3 letters. [2025-01-10 07:10:36,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:36,433 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:10:36,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:36,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 07:10:36,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 07:10:36,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:36,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:36,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 07:10:36,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:36,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:36,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:36,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:36,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:36,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 07:10:36,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:36,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2025-01-10 07:10:36,709 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:10:36,709 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-01-10 07:10:36,710 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 55 transitions. cyclomatic complexity: 13 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 07:10:36,779 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 55 transitions. cyclomatic complexity: 13. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 66 states and 75 transitions. Complement of second has 15 states. [2025-01-10 07:10:36,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-01-10 07:10:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 07:10:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2025-01-10 07:10:36,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 39 letters. Loop has 3 letters. [2025-01-10 07:10:36,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:36,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 42 letters. Loop has 3 letters. [2025-01-10 07:10:36,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:36,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 39 letters. Loop has 6 letters. [2025-01-10 07:10:36,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:36,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 75 transitions. [2025-01-10 07:10:36,782 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:10:36,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2025-01-10 07:10:36,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 07:10:36,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 07:10:36,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 07:10:36,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:10:36,782 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:10:36,782 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:10:36,782 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:10:36,782 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 07:10:36,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-01-10 07:10:36,782 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:10:36,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-01-10 07:10:36,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:10:36 BoogieIcfgContainer [2025-01-10 07:10:36,793 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:10:36,793 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:10:36,794 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:10:36,794 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:10:36,794 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:10:11" (3/4) ... [2025-01-10 07:10:36,795 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 07:10:36,796 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:10:36,796 INFO L158 Benchmark]: Toolchain (without parser) took 25586.38ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 105.6MB in the beginning and 256.5MB in the end (delta: -150.9MB). Peak memory consumption was 133.6MB. Max. memory is 16.1GB. [2025-01-10 07:10:36,796 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:10:36,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.80ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 95.2MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:10:36,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.25ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 94.3MB in the end (delta: 910.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:10:36,797 INFO L158 Benchmark]: Boogie Preprocessor took 31.70ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:10:36,797 INFO L158 Benchmark]: RCFGBuilder took 234.55ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 81.2MB in the end (delta: 11.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:10:36,797 INFO L158 Benchmark]: BuchiAutomizer took 25122.19ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 81.2MB in the beginning and 256.7MB in the end (delta: -175.5MB). Peak memory consumption was 108.4MB. Max. memory is 16.1GB. [2025-01-10 07:10:36,797 INFO L158 Benchmark]: Witness Printer took 2.15ms. Allocated memory is still 427.8MB. Free memory was 256.7MB in the beginning and 256.5MB in the end (delta: 129.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:10:36,798 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.19ms. Allocated memory is still 226.5MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.80ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 95.2MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.25ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 94.3MB in the end (delta: 910.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.70ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 234.55ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 81.2MB in the end (delta: 11.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 25122.19ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 81.2MB in the beginning and 256.7MB in the end (delta: -175.5MB). Peak memory consumption was 108.4MB. Max. memory is 16.1GB. * Witness Printer took 2.15ms. Allocated memory is still 427.8MB. Free memory was 256.7MB in the beginning and 256.5MB in the end (delta: 129.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~ip~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 10 locations. One deterministic module has affine ranking function null and consists of 5 locations. One nondeterministic module has affine ranking function null and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 48 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 25.0s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 22.1s. Construction of modules took 0.5s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 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: 30/30 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 140 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 489 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 404 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 820 IncrementalHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 85 mSDtfsCounter, 820 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital267 mio100 ax100 hnf100 lsp98 ukn59 mio100 lsp38 div100 bol100 ite100 ukn100 eq163 hnf95 smp100 dnf2551 smp71 tf100 neg100 sie130 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 753ms VariablesStem: 2 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 16 SupportingInvariants: 32 MotzkinApplications: 608 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 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:10:36,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:37,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:37,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:37,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE